About the Project

Bernoulli and Euler polynomials

AdvancedHelp

(0.004 seconds)

11—20 of 46 matching pages

11: 24.9 Inequalities
§24.9 Inequalities
12: 24.12 Zeros
§24.12(iii) Complex Zeros
For complex zeros of Bernoulli and Euler polynomials, see Delange (1987) and Dilcher (1988). A related topic is the irreducibility of Bernoulli and Euler polynomials. …
§24.12(iv) Multiple Zeros
13: 24 Bernoulli and Euler Polynomials
Chapter 24 Bernoulli and Euler Polynomials
14: 24.5 Recurrence Relations
§24.5 Recurrence Relations
15: 24.7 Integral Representations
§24.7(ii) Bernoulli and Euler Polynomials
16: 24.11 Asymptotic Approximations
24.11.4 ( 1 ) n E 2 n 8 n π ( 4 n π e ) 2 n .
17: 24.8 Series Expansions
§24.8(i) Fourier Series
24.8.1 B 2 n ( x ) = ( 1 ) n + 1 2 ( 2 n ) ! ( 2 π ) 2 n k = 1 cos ( 2 π k x ) k 2 n ,
24.8.2 B 2 n + 1 ( x ) = ( 1 ) n + 1 2 ( 2 n + 1 ) ! ( 2 π ) 2 n + 1 k = 1 sin ( 2 π k x ) k 2 n + 1 .
If n = 1 , 2 , and 0 x 1 , then …
§24.8(ii) Other Series
18: 24.19 Methods of Computation
§24.19(i) Bernoulli and Euler Numbers and Polynomials
For algorithms for computing B n , E n , B n ( x ) , and E n ( x ) see Spanier and Oldham (1987, pp. 37, 41, 171, and 179–180). …
19: 24.6 Explicit Formulas
24.6.6 E 2 n = k = 1 2 n ( 1 ) k 2 k 1 ( 2 n + 1 k + 1 ) j = 0 1 2 k 1 2 ( k j ) ( k 2 j ) 2 n .
24.6.7 B n ( x ) = k = 0 n 1 k + 1 j = 0 k ( 1 ) j ( k j ) ( x + j ) n ,
20: Karl Dilcher