Euler%20pentagonal%20number%20theorem

SearchAdvancedHelp

(0.004 seconds)

1—10 of 574 matching pages

1: 24.1 Special Notation

… ►

Bernoulli Numbers and Polynomials

►The origin of the notation $B_n$, $B_n\left(x\right)$, 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\left(x\right)$, as defined in §24.2(ii), were used in Lucas (1891) and Nörlund (1924). …

2: 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 $\le n$ that are relatively prime to $n$; $\varphi \left(n\right)$ is Euler’s totient. ►If $\left(a,n\right)=1$, then the Euler–Fermat theorem states that …The $\varphi \left(n\right)$ numbers $a,a^2,\mathrm{\dots },a^{\varphi \left(n\right)}$ are relatively prime to $n$ and distinct (mod $n$). …Note that $J_1\left(n\right)=\varphi \left(n\right)$. …

3: Bibliography

… ►

Exact linearization of a Painlevé transcendent. Phys. Rev. Lett. 38 (20), pp. 1103–1106.

ⓘ

External Links:

Document, MathReview (Mark Adler)

Referenced by:

§32.11(ii), §32.13(i), §32.13(ii), §32.13(iii), §32.5.

Encodings:

BibTeX

… ►

On the degrees of irreducible factors of higher order Bernoulli polynomials. Acta Arith. 62 (4), pp. 329–342.

ⓘ

External Links:

ISSN 0065-1036, Pdf, MathReview (L. Skula), ZentralBlatt

Referenced by:

§24.12(iii).

Encodings:

BibTeX

… ►

Application of the combined nonlinear-condensation transformation to problems in statistical analysis and theoretical physics. Comput. Phys. Comm. 150 (1), pp. 1–20.

ⓘ

Notes:

Includes algorithms for Lerch’s transcendent. C and Mathematica codes by Aksenov and Jentschura are available.

External Links:

Code, Document

Referenced by:

1st item.

Encodings:

BibTeX

… ►

Repeated integrals and derivatives of $K$ Bessel functions. SIAM J. Math. Anal. 20 (1), pp. 169–175.

ⓘ

External Links:

ISSN 0036-1410, Document, MathReview (A. Haimovici), ZentralBlatt

Referenced by:

§10.43(iii).

Encodings:

BibTeX

… ►

Umbral calculus, Bailey chains, and pentagonal number theorems. J. Combin. Theory Ser. A 91 (1-2), pp. 464–475.

ⓘ

Notes:

In memory of Gian-Carlo Rota

External Links:

ISSN 0097-3165, Document, MathReview (Alessandro Di Bucchianico), ZentralBlatt

Referenced by:

§17.12.

Encodings:

BibTeX

…

4: 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. …

5: 8.26 Tables

… ►

Khamis (1965) tabulates $P(a,x)$ for $a=0.05(.05)10(.1)20(.25)70$, $0.0001\le x\le 250$ to 10D.

… ►

Zhang and Jin (1996, Table 3.8) tabulates $\gamma (a,x)$ for $a=0.5,1,3,5,10,25,50,100$, $x=0(.1)1(1)3,5(5)30,50,100$ to 8D or 8S.

… ►

Abramowitz and Stegun (1964, pp. 245–248) tabulates $E_n\left(x\right)$ for $n=2,3,4,10,20$, $x=0(.01)2$ to 7D; also $(x+n){\mathrm{e}}^x{E}_n\left(x\right)$ for $n=2,3,4,10,20$, $x^{-1}=0(.01)0.1(.05)0.5$ to 6S.

… ►

Pagurova (1961) tabulates $E_n\left(x\right)$ for $n=0(1)20$, $x=0(.01)2(.1)10$ to 4-9S; ${\mathrm{e}}^x{E}_n\left(x\right)$ for $n=2(1)10$, $x=10(.1)20$ to 7D; ${\mathrm{e}}^x{E}_p\left(x\right)$ for $p=0(.1)1$, $x=0.01(.01)7(.05)12(.1)20$ to 7S or 7D.

… ►

Zhang and Jin (1996, Table 19.1) tabulates $E_n\left(x\right)$ for $n=1,2,3,5,10,15,20$, $x=0(.1)1,1.5,2,3,5,10,20,30,50,100$ to 7D or 8S.

6: 20 Theta Functions

Chapter 20 Theta Functions

…

7: 27.14 Unrestricted Partitions

… ►Euler introduced the reciprocal of the infinite product …Euler’s pentagonal number theorem states that …where the exponents $1$, $2$, $5$, $7$, $12$, $15$, $\mathrm{\dots }$ are the pentagonal numbers, defined by … ►Multiplying the power series for $f\left(x\right)$ with that for $1/f\left(x\right)$ and equating coefficients, we obtain the recursion formula … ►This is related to the function $f\left(x\right)$ in (27.14.2) by …

8: 27.15 Chinese Remainder Theorem

§27.15 Chinese Remainder Theorem

… ►This theorem is employed to increase efficiency in calculating with large numbers by making use of smaller numbers in most of the calculation. …Their product $m$ has 20 digits, twice the number of digits in the data. By the Chinese remainder theorem each integer in the data can be uniquely represented by its residues (mod $m_1$), (mod $m_2$), (mod $m_3$), and (mod $m_4$), respectively. …These numbers, in turn, are combined by the Chinese remainder theorem to obtain the final result $(modm)$, which is correct to 20 digits. …

9: 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.4: Euler numbers $E_n$.

► ►►►

$n$	$E_n$
…
$20$	$\mathrm{37037\hspace{0.33em}11882\hspace{0.33em}37525}$
…

►

…

10: 5.22 Tables

… ►Abramowitz and Stegun (1964, Chapter 6) tabulates $\mathrm{\Gamma }\left(x\right)$, $\ln \mathrm{\Gamma }\left(x\right)$, $\psi \left(x\right)$, and ${\psi }^{\prime }\left(x\right)$ for $x=1(.005)2$ to 10D; ${\psi }^{\prime \prime }\left(x\right)$ and ${\psi }^{(3)}\left(x\right)$ for $x=1(.01)2$ to 10D; $\mathrm{\Gamma }\left(n\right)$, $1/\mathrm{\Gamma }\left(n\right)$, $\mathrm{\Gamma }\left(n+\frac{1}{2}\right)$, $\psi \left(n\right)$, ${\log }_{10}\mathrm{\Gamma }\left(n\right)$, ${\log }_{10}\mathrm{\Gamma }\left(n+\frac{1}{3}\right)$, ${\log }_{10}\mathrm{\Gamma }\left(n+\frac{1}{2}\right)$, and ${\log }_{10}\mathrm{\Gamma }\left(n+\frac{2}{3}\right)$ for $n=1(1)101$ to 8–11S; $\mathrm{\Gamma }\left(n+1\right)$ for $n=100(100)1000$ to 20S. Zhang and Jin (1996, pp. 67–69 and 72) tabulates $\mathrm{\Gamma }\left(x\right)$, $1/\mathrm{\Gamma }\left(x\right)$, $\mathrm{\Gamma }\left(-x\right)$, $\ln \mathrm{\Gamma }\left(x\right)$, $\psi \left(x\right)$, $\psi \left(-x\right)$, ${\psi }^{\prime }\left(x\right)$, and ${\psi }^{\prime }\left(-x\right)$ for $x=0(.1)5$ to 8D or 8S; $\mathrm{\Gamma }\left(n+1\right)$ for $n=0(1)100(10)250(50)500(100)3000$ to 51S. … ►Abramov (1960) tabulates $\ln \mathrm{\Gamma }\left(x+\mathrm{i}y\right)$ for $x=1$ ($.01$) $2$, $y=0$ ($.01$) $4$ to 6D. Abramowitz and Stegun (1964, Chapter 6) tabulates $\ln \mathrm{\Gamma }\left(x+\mathrm{i}y\right)$ for $x=1$ ($.1$) $2$, $y=0$ ($.1$) $10$ to 12D. …Zhang and Jin (1996, pp. 70, 71, and 73) tabulates the real and imaginary parts of $\mathrm{\Gamma }\left(x+\mathrm{i}y\right)$, $\ln \mathrm{\Gamma }\left(x+\mathrm{i}y\right)$, and $\psi \left(x+\mathrm{i}y\right)$ for $x=0.5,1,5,10$, $y=0(.5)10$ to 8S.