as Bernoulli or Euler polynomials
(0.008 seconds)
11—20 of 148 matching pages
11: 24.19 Methods of Computation
…
►
•
…
§24.19(i) Bernoulli and Euler Numbers and Polynomials
… ►For algorithms for computing , , , and see Spanier and Oldham (1987, pp. 37, 41, 171, and 179–180). ►§24.19(ii) Values of Modulo
… ►We list here three methods, arranged in increasing order of efficiency. ►Tanner and Wagstaff (1987) derives a congruence for Bernoulli numbers in terms of sums of powers. See also §24.10(iii).
12: 24.9 Inequalities
13: 24.5 Recurrence Relations
§24.5 Recurrence Relations
… ►
24.5.1
,
►
24.5.2
.
…
►
§24.5(ii) Other Identities
… ►§24.5(iii) Inversion Formulas
…14: 24 Bernoulli and Euler Polynomials
Chapter 24 Bernoulli and Euler Polynomials
…15: 24.7 Integral Representations
…
►
§24.7(i) Bernoulli and Euler Numbers
… ►
24.7.3
…
►
§24.7(ii) Bernoulli and Euler Polynomials
… ►
24.7.9
►
24.7.10
…
16: 24.12 Zeros
…
►
§24.12(i) Bernoulli Polynomials: Real 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
…17: 24.6 Explicit Formulas
18: 24.11 Asymptotic Approximations
19: Karl Dilcher
…
►Over the years he authored or coauthored numerous papers on Bernoulli numbers and related topics, and he maintains a large on-line bibliography on the subject.
…
►
…