About the Project

additive%20number%20theory

AdvancedHelp

(0.001 seconds)

21—30 of 385 matching pages

21: Gergő Nemes
Nemes has research interests in asymptotic analysis, Écalle theory, exact WKB analysis, and special functions. As of September 20, 2021, Nemes performed a complete analysis and acted as main consultant for the update of the source citation and proof metadata for every formula in Chapter 25 Zeta and Related Functions. …
22: Wolter Groenevelt
Groenevelt’s research interests is in special functions and orthogonal polynomials and their relations with representation theory and interacting particle systems. As of September 20, 2022, Groenevelt performed a complete analysis and acted as main consultant for the update of the source citation and proof metadata for every formula in Chapter 18 Orthogonal Polynomials. …
23: 9.18 Tables
Additional listings of early tables of the functions treated in this chapter are given in Fletcher et al. (1962) and Lebedev and Fedorova (1960). …
  • Zhang and Jin (1996, p. 337) tabulates Ai ( x ) , Ai ( x ) , Bi ( x ) , Bi ( x ) for x = 0 ( 1 ) 20 to 8S and for x = 20 ( 1 ) 0 to 9D.

  • Miller (1946) tabulates a k , Ai ( a k ) , a k , Ai ( a k ) , k = 1 ( 1 ) 50 ; b k , Bi ( b k ) , b k , Bi ( b k ) , k = 1 ( 1 ) 20 . Precision is 8D. Entries for k = 1 ( 1 ) 20 are reproduced in Abramowitz and Stegun (1964, Chapter 10).

  • Sherry (1959) tabulates a k , Ai ( a k ) , a k , Ai ( a k ) , k = 1 ( 1 ) 50 ; 20S.

  • Zhang and Jin (1996, p. 339) tabulates a k , Ai ( a k ) , a k , Ai ( a k ) , b k , Bi ( b k ) , b k , Bi ( b k ) , k = 1 ( 1 ) 20 ; 8D.

  • 24: 26.11 Integer Partitions: Compositions
    c ( n ) denotes the number of compositions of n , and c m ( n ) is the number of compositions into exactly m parts. c ( T , n ) is the number of compositions of n with no 1’s, where again T = { 2 , 3 , 4 , } . …
    26.11.1 c ( 0 ) = c ( T , 0 ) = 1 .
    The Fibonacci numbers are determined recursively by … Additional information on Fibonacci numbers can be found in Rosen et al. (2000, pp. 140–145).
    25: DLMF Project News
    error generating summary
    26: 26.6 Other Lattice Path Numbers
    §26.6 Other Lattice Path Numbers
    Delannoy Number D ( m , n )
    Motzkin Number M ( n )
    Narayana Number N ( n , k )
    §26.6(iv) Identities
    27: 26.14 Permutations: Order Notation
    As an example, 35247816 is an element of 𝔖 8 . The inversion number is the number of pairs of elements for which the larger element precedes the smaller: … The Eulerian number, denoted n k , is the number of permutations in 𝔖 n with exactly k descents. …The Eulerian number n k is equal to the number of permutations in 𝔖 n with exactly k excedances. …
    §26.14(iii) Identities
    28: Bibliography N
  • W. Narkiewicz (2000) The Development of Prime Number Theory: From Euclid to Hardy and Littlewood. Springer-Verlag, Berlin.
  • D. Naylor (1989) On an integral transform involving a class of Mathieu functions. SIAM J. Math. Anal. 20 (6), pp. 1500–1513.
  • W. J. Nellis and B. C. Carlson (1966) Reduction and evaluation of elliptic integrals. Math. Comp. 20 (94), pp. 223–231.
  • E. W. Ng and M. Geller (1969) A table of integrals of the error functions. J. Res. Nat. Bur. Standards Sect B. 73B, pp. 1–20.
  • Number Theory Web (website)
  • 29: Sidebar 7.SB1: Diffraction from a Straightedge
    The faint circular patterns are additional diffraction effects due to imperfections in the edge.
    30: 12 Parabolic Cylinder Functions