About the Project

Bernoulli%20numbers

AdvancedHelp

(0.001 seconds)

1—10 of 21 matching pages

1: Bibliography L
  • D. J. Leeming (1977) An asymptotic estimate for the Bernoulli and Euler numbers. Canad. Math. Bull. 20 (1), pp. 109–111.
  • 2: 25.6 Integer Arguments
    25.6.3 ζ ( n ) = B n + 1 n + 1 , n = 1 , 2 , 3 , .
    3: 24.2 Definitions and Generating Functions
    §24.2 Definitions and Generating Functions
    §24.2(i) Bernoulli Numbers and Polynomials
    §24.2(ii) Euler Numbers and Polynomials
    §24.2(iii) Periodic Bernoulli and Euler Functions
    Table 24.2.1: Bernoulli and Euler numbers.
    n B n E n
    4: Bibliography I
  • K. Inkeri (1959) The real roots of Bernoulli polynomials. Ann. Univ. Turku. Ser. A I 37, pp. 1–20.
  • K. Ireland and M. Rosen (1990) A Classical Introduction to Modern Number Theory. 2nd edition, Springer-Verlag, New York.
  • 5: Software Index
    Open Source With Book Commercial
    20 Theta Functions
    24 Bernoulli and Euler Polynomials
    24.21(ii) B n , B n ( x ) , E n , E n ( x ) a Derive, MuPAD
    27 Functions of Number Theory
  • Software Associated with Books.

    An increasing number of published books have included digital media containing software described in the book. Often, the collection of software covers a fairly broad area. Such software is typically developed by the book author. While it is not professionally packaged, it often provides a useful tool for readers to experiment with the concepts discussed in the book. The software itself is typically not formally supported by its authors.

  • 6: 24.20 Tables
    §24.20 Tables
    Wagstaff (1978) gives complete prime factorizations of N n and E n for n = 20 ( 2 ) 60 and n = 8 ( 2 ) 42 , respectively. …
    7: Bibliography
  • A. Adelberg (1992) On the degrees of irreducible factors of higher order Bernoulli polynomials. Acta Arith. 62 (4), pp. 329–342.
  • A. Adelberg (1996) Congruences of p -adic integer order Bernoulli numbers. J. Number Theory 59 (2), pp. 374–388.
  • W. A. Al-Salam and L. Carlitz (1959) Some determinants of Bernoulli, Euler and related numbers. Portugal. Math. 18, pp. 91–99.
  • H. Alzer (2000) Sharp bounds for the Bernoulli numbers. Arch. Math. (Basel) 74 (3), pp. 207–211.
  • T. M. Apostol (2008) A primer on Bernoulli numbers and polynomials. Math. Mag. 81 (3), pp. 178–190.
  • 8: Bibliography C
  • L. Carlitz (1953) Some congruences for the Bernoulli numbers. Amer. J. Math. 75 (1), pp. 163–172.
  • L. Carlitz (1954a) q -Bernoulli and Eulerian numbers. Trans. Amer. Math. Soc. 76 (2), pp. 332–350.
  • L. Carlitz (1958) Expansions of q -Bernoulli numbers. Duke Math. J. 25 (2), pp. 355–364.
  • M. Chellali (1988) Accélération de calcul de nombres de Bernoulli. J. Number Theory 28 (3), pp. 347–362 (French).
  • R. Chelluri, L. B. Richmond, and N. M. Temme (2000) Asymptotic estimates for generalized Stirling numbers. Analysis (Munich) 20 (1), pp. 1–13.
  • 9: Bibliography K
  • M. Kaneko (1997) Poly-Bernoulli numbers. J. Théor. Nombres Bordeaux 9 (1), pp. 221–228.
  • N. M. Katz (1975) The congruences of Clausen-von Staudt and Kummer for Bernoulli-Hurwitz numbers. Math. Ann. 216 (1), pp. 1–4.
  • R. P. Kelisky (1957) On formulas involving both the Bernoulli and Fibonacci numbers. Scripta Math. 23, pp. 27–35.
  • T. Kim and H. S. Kim (1999) Remark on p -adic q -Bernoulli numbers. Adv. Stud. Contemp. Math. (Pusan) 1, pp. 127–136.
  • D. E. Knuth and T. J. Buckholtz (1967) Computation of tangent, Euler, and Bernoulli numbers. Math. Comp. 21 (100), pp. 663–688.
  • 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. …
    §26.14(iii) Identities
    In this subsection S ( n , k ) is again the Stirling number of the second kind (§26.8), and B m is the m th Bernoulli number24.2(i)). …