About the Project

Zelle service +1205⥊892⥊1862 Phone☎️☎️$☎️☎️ "Number"#2022

AdvancedHelp

Did you mean elle service +1205⥊892⥊1862 honneur☎️☎️$☎️☎️ "Number"#2022 ?

(0.005 seconds)

1—10 of 223 matching pages

1: 24.1 Special Notation
Bernoulli Numbers and Polynomials
The origin of the notation B n , B n ( x ) , is not clear. …
Euler Numbers and Polynomials
Its coefficients were first studied in Euler (1755); they were called Euler numbers by Raabe in 1851. The notations E n , E n ( x ) , as defined in §24.2(ii), were used in Lucas (1891) and Nörlund (1924). …
2: Bibliography I
  • K. Ireland and M. Rosen (1990) A Classical Introduction to Modern Number Theory. 2nd edition, Springer-Verlag, New York.
  • A. R. Its and A. A. Kapaev (1987) The method of isomonodromic deformations and relation formulas for the second Painlevé transcendent. Izv. Akad. Nauk SSSR Ser. Mat. 51 (4), pp. 878–892, 912 (Russian).
  • 3: Bibliography F
  • H. E. Fettis and J. C. Caslin (1969) A Table of the Complete Elliptic Integral of the First Kind for Complex Values of the Modulus. Part I. Technical report Technical Report ARL 69-0172, Aerospace Research Laboratories, Office of Aerospace Research, Wright-Patterson Air Force Base, Ohio.
  • H. E. Fettis (1970) On the reciprocal modulus relation for elliptic integrals. SIAM J. Math. Anal. 1 (4), pp. 524–526.
  • S. Fillebrown (1992) Faster computation of Bernoulli numbers. J. Algorithms 13 (3), pp. 431–445.
  • Y. V. Fyodorov (2005) Introduction to the Random Matrix Theory: Gaussian Unitary Ensemble and Beyond. In Recent Perspectives in Random Matrix Theory and Number Theory, London Math. Soc. Lecture Note Ser., Vol. 322, pp. 31–78.
  • 4: Bibliography M
  • Magma (website) Computational Algebra Group, School of Mathematics and Statistics, University of Sydney, Australia.
  • C. Micu and E. Papp (2005) Applying q -Laguerre polynomials to the derivation of q -deformed energies of oscillator and Coulomb systems. Romanian Reports in Physics 57 (1), pp. 25–34.
  • L. J. Mordell (1917) On the representation of numbers as a sum of 2 r squares. Quarterly Journal of Math. 48, pp. 93–104.
  • L. Moser and M. Wyman (1958a) Asymptotic development of the Stirling numbers of the first kind. J. London Math. Soc. 33, pp. 133–146.
  • L. Moser and M. Wyman (1958b) Stirling numbers of the second kind. Duke Math. J. 25 (1), pp. 29–43.
  • 5: 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).
    6: 27.18 Methods of Computation: Primes
    §27.18 Methods of Computation: Primes
    An overview of methods for precise counting of the number of primes not exceeding an arbitrary integer x is given in Crandall and Pomerance (2005, §3.7). …An analytic approach using a contour integral of the Riemann zeta function (§25.2(i)) is discussed in Borwein et al. (2000). … These algorithms are used for testing primality of Mersenne numbers, 2 n 1 , and Fermat numbers, 2 2 n + 1 . …
    7: 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
    8: 24.15 Related Sequences of Numbers
    §24.15 Related Sequences of Numbers
    §24.15(i) Genocchi Numbers
    §24.15(ii) Tangent Numbers
    §24.15(iii) Stirling Numbers
    §24.15(iv) Fibonacci and Lucas Numbers
    9: 26.5 Lattice Paths: Catalan Numbers
    §26.5 Lattice Paths: Catalan Numbers
    §26.5(i) Definitions
    C ( n ) is the Catalan number. …
    §26.5(ii) Generating Function
    §26.5(iii) Recurrence Relations
    10: 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