About the Project

Euler%20numbers

AdvancedHelp

(0.002 seconds)

1—10 of 18 matching pages

1: 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. …
2: Bibliography L
  • D. J. Leeming (1977) An asymptotic estimate for the Bernoulli and Euler numbers. Canad. Math. Bull. 20 (1), pp. 109–111.
  • 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: 25.6 Integer Arguments
    §25.6(i) Function Values
    25.6.2 ζ ( 2 n ) = ( 2 π ) 2 n 2 ( 2 n ) ! | B 2 n | , n = 1 , 2 , 3 , .
    25.6.3 ζ ( n ) = B n + 1 n + 1 , n = 1 , 2 , 3 , .
    where γ 1 is given by (25.2.5). …
    25.6.15 ζ ( 2 n ) = ( 1 ) n + 1 ( 2 π ) 2 n 2 ( 2 n ) ! ( 2 n ζ ( 1 2 n ) ( ψ ( 2 n ) ln ( 2 π ) ) B 2 n ) .
    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: 27.2 Functions
    Euclid’s Elements (Euclid (1908, Book IX, Proposition 20)) gives an elegant proof that there are infinitely many primes. … This is the number of positive integers n that are relatively prime to n ; ϕ ( n ) is Euler’s totient. … The ϕ ( n ) numbers a , a 2 , , a ϕ ( n ) are relatively prime to n and distinct (mod n ). … …
    §27.2(ii) Tables
    7: 5.11 Asymptotic Expansions
    5.11.1 Ln Γ ( z ) ( z 1 2 ) ln z z + 1 2 ln ( 2 π ) + k = 1 B 2 k 2 k ( 2 k 1 ) z 2 k 1
    For the Bernoulli numbers B 2 k , see §24.2(i). … The scaled gamma function Γ ( z ) is defined in (5.11.3) and its main property is Γ ( z ) 1 as z in the sector | ph z | π δ . Wrench (1968) gives exact values of g k up to g 20 . …For explicit formulas for g k in terms of Stirling numbers see Nemes (2013a), and for asymptotic expansions of g k as k see Boyd (1994) and Nemes (2015a). …
    8: Bibliography
  • M. J. Ablowitz and H. Segur (1977) Exact linearization of a Painlevé transcendent. Phys. Rev. Lett. 38 (20), pp. 1103–1106.
  • 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.
  • T. M. Apostol (2000) A Centennial History of the Prime Number Theorem. In Number Theory, Trends Math., pp. 1–14.
  • 9: 9.7 Asymptotic Expansions
    9.7.3 χ ( x ) π 1 / 2 Γ ( 1 2 x + 1 ) / Γ ( 1 2 x + 1 2 ) .
    9.7.4 χ ( x ) ( 1 2 π x ) 1 / 2 .
    Numerical values of χ ( n ) are given in Table 9.7.1 for n = 1 ( 1 ) 20 to 2D.
    Table 9.7.1: χ ( n ) .
    n χ ( n ) n χ ( n ) n χ ( n ) n χ ( n )
    5 2.95 10 4.06 15 4.94 20 5.68
    9.7.22 G p ( z ) = e z 2 π Γ ( p ) Γ ( 1 p , z ) .
    10: 25.11 Hurwitz Zeta Function
    See accompanying text
    Figure 25.11.1: Hurwitz zeta function ζ ( x , a ) , a = 0. …8, 1, 20 x 10 . … Magnify
    §25.11(iii) Representations by the Euler–Maclaurin Formula
    25.11.28 ζ ( s , a ) = 1 2 a s + a 1 s s 1 + k = 1 n B 2 k ( 2 k ) ! ( s ) 2 k 1 a 1 s 2 k + 1 Γ ( s ) 0 ( 1 e x 1 1 x + 1 2 k = 1 n B 2 k ( 2 k ) ! x 2 k 1 ) x s 1 e a x d x , s > ( 2 n + 1 ) , s 1 , a > 0 .
    where H n are the harmonic numbers: …
    25.11.43 ζ ( s , a ) a 1 s s 1 1 2 a s k = 1 B 2 k ( 2 k ) ! ( s ) 2 k 1 a 1 s 2 k .