DLMF: Untitled Document

… ►As of September 20, 2021, Nemes performed a complete analysis and acted as main consultant for the update of the source citation and proof metadata for every formula in Chapter 25 Zeta and Related Functions. …

… ►As of September 20, 2022, Groenevelt performed a complete analysis and acted as main consultant for the update of the source citation and proof metadata for every formula in Chapter 18 Orthogonal Polynomials. …

… ►

•

Abramowitz and Stegun (1964, Chapter 14) tabulates $F_{0}\left(\eta,\rho\right)$ , $G_{0}\left(\eta,\rho\right)$ , $F_{0}'\left(\eta,\rho\right)$ , and $G_{0}'\left(\eta,\rho\right)$ for $\eta=0.5(.5)20$ and $\rho=1(1)20$ , 5S; $C_{0}\left(\eta\right)$ for $\eta=0(.05)3$ , 6S.

…

… ►

See accompanying text — Figure 25.12.1: Dilogarithm function $\operatorname{Li}_{2}\left(x\right)$ , $-20\leq x<1.$ Magnify

►

… ►The special case

z=1

is the Riemann zeta function:

\zeta\left(s\right)=\operatorname{Li}_{s}\left(1\right)

. … ►(In the latter case (25.12.11) becomes (25.5.1)). …

… ►Euclid’s Elements (Euclid (1908, Book IX, Proposition 20)) gives an elegant proof that there are infinitely many primes. … ►It is the special case

k=2

of the function

d_{k}\left(n\right)

that counts the number of ways of expressing

n

as the product of

k

factors, with the order of factors taken into account. … ►

Table 27.2.2: Functions related to division.

► ►►►►►

$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$	$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$	$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$	$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$
…
5	4	2	6	18	6	6	39	31	30	2	32	44	20	6	84
6	2	4	12	19	18	2	20	32	16	6	63	45	24	6	78
7	6	2	8	20	8	6	42	33	20	4	48	46	22	4	72
…

►

… ►Their product

m

has 20 digits, twice the number of digits in the data. …These numbers, in turn, are combined by the Chinese remainder theorem to obtain the final result

\pmod{m}

, which is correct to 20 digits. …

… ►

20 Theta Functions

… ►In November 2015, Reinhardt was named Senior Associate Editor of the DLMF and Associate Editor for Chapters 20, 22, and 23.

… ►All solutions are analytic at an ordinary point, and their Taylor-series expansions are found by equating coefficients. … ►To include the point at infinity in the foregoing classification scheme, we transform it into the origin by replacing

z

in (2.7.1) with

1/z

; see Olver (1997b, pp. 153–154). … ►Hence unless the series (2.7.8) terminate (in which case the corresponding

\Lambda_{j}

is zero) they diverge. … ►This phenomenon is an example of resurgence, a classification due to Écalle (1981a, b). … ►The exceptional case

f_{0}^{2}=4g_{0}

is handled by Fabry’s transformation: …

… ►

•

Blanch and Clemm (1965) includes values of ${\operatorname{Mc}^{(2)}_{n}}\left(x,\sqrt{q}\right)$ , ${\operatorname{Mc}^{(2)}_{n}}'\left(x,\sqrt{q}\right)$ for $n=0(1)7$ , $x=0(.02)1$ ; $n=8(1)15$ , $x=0(.01)1$ . Also ${\operatorname{Ms}^{(2)}_{n}}\left(x,\sqrt{q}\right)$ , ${\operatorname{Ms}^{(2)}_{n}}'\left(x,\sqrt{q}\right)$ for $n=1(1)7$ , $x=0(.02)1$ ; $n=8(1)15$ , $x=0(.01)1$ . In all cases $q=0(.05)1$ . Precision is generally 7D. Approximate formulas and graphs are also included.

… ►

•

Ince (1932) includes eigenvalues $a_{n}$ , $b_{n}$ , and Fourier coefficients for $n=0$ or $1(1)6$ , $q=0(1)10(2)20(4)40$ ; 7D. Also $\operatorname{ce}_{n}\left(x,q\right)$ , $\operatorname{se}_{n}\left(x,q\right)$ for $q=0(1)10$ , $x=1(1)90$ , corresponding to the eigenvalues in the tables; 5D. Notation: $a_{n}=\mathit{be}_{n}-2q$ , $b_{n}=\mathit{bo}_{n}-2q$ .

►

•

Kirkpatrick (1960) contains tables of the modified functions $\operatorname{Ce}_{n}\left(x,q\right)$ , $\operatorname{Se}_{n+1}\left(x,q\right)$ for $n=0(1)5$ , $q=1(1)20$ , $x=0.1(.1)1$ ; 4D or 5D.

►

•

National Bureau of Standards (1967) includes the eigenvalues $a_{n}\left(q\right)$ , $b_{n}\left(q\right)$ for $n=0(1)3$ with $q=0(.2)20(.5)37(1)100$ , and $n=4(1)15$ with $q=0(2)100$ ; Fourier coefficients for $\operatorname{ce}_{n}\left(x,q\right)$ and $\operatorname{se}_{n}\left(x,q\right)$ for $n=0(1)15$ , $n=1(1)15$ , respectively, and various values of $q$ in the interval $[0,100]$ ; joining factors $g_{\mathit{e},n}(\sqrt{q})$ , $f_{\mathit{e},n}(\sqrt{q})$ for $n=0(1)15$ with $q=0(.5\mbox{ to }10)100$ (but in a different notation). Also, eigenvalues for large values of $q$ . Precision is generally 8D.

… ►

•

Zhang and Jin (1996, pp. 521–532) includes the eigenvalues $a_{n}\left(q\right)$ , $b_{n+1}\left(q\right)$ for $n=0(1)4$ , $q=0(1)50$ ; $n=0(1)20$ ( $a$ ’s) or 19 ( $b$ ’s), $q=1,3,5,10,15,25,50(50)200$ . Fourier coefficients for $\operatorname{ce}_{n}\left(x,10\right)$ , $\operatorname{se}_{n+1}\left(x,10\right)$ , $n=0(1)7$ . Mathieu functions $\operatorname{ce}_{n}\left(x,10\right)$ , $\operatorname{se}_{n+1}\left(x,10\right)$ , and their first $x$ -derivatives for $n=0(1)4$ , $x=0(5^{\circ})90^{\circ}$ . Modified Mathieu functions ${\operatorname{Mc}^{(j)}_{n}}\left(x,\sqrt{10}\right)$ , ${\operatorname{Ms}^{(j)}_{n+1}}\left(x,\sqrt{10}\right)$ , and their first $x$ -derivatives for $n=0(1)4$ , $j=1,2$ , $x=0(.2)4$ . Precision is mostly 9S.

…

… ►

•

Zhang and Jin (1996, pp. 652, 689) includes $\operatorname{Si}\left(x\right)$ , $\operatorname{Ci}\left(x\right)$ , $x=0(.5)20(2)30$ , 8D; $\operatorname{Ei}\left(x\right)$ , $E_{1}\left(x\right)$ , $x=[0,100]$ , 8S.

… ►

•

Abramowitz and Stegun (1964, Chapter 5) includes the real and imaginary parts of $ze^{z}E_{1}\left(z\right)$ , $x=-19(1)20$ , $y=0(1)20$ , 6D; $e^{z}E_{1}\left(z\right)$ , $x=-4(.5)-2$ , $y=0(.2)1$ , 6D; $E_{1}\left(z\right)+\ln z$ , $x=-2(.5)2.5$ , $y=0(.2)1$ , 6D.

►

•

Zhang and Jin (1996, pp. 690–692) includes the real and imaginary parts of $E_{1}\left(z\right)$ , $\pm x=0.5,1,3,5,10,15,20,50,100$ , $y=0(.5)1(1)5(5)30,50,100$ , 8S.

classification%20of%20cases

11—20 of 365 matching pages

11: Gergő Nemes

12: Wolter Groenevelt

13: 33.24 Tables

14: 25.12 Polylogarithms

15: 27.2 Functions

16: 27.15 Chinese Remainder Theorem

17: William P. Reinhardt

18: 2.7 Differential Equations

19: 28.35 Tables

20: 6.19 Tables

$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$	$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$	$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$	$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$
…
5	4	2	6	18	6	6	39	31	30	2	32	44	20	6	84
6	2	4	12	19	18	2	20	32	16	6	63	45	24	6	78
7	6	2	8	20	8	6	42	33	20	4	48	46	22	4	72
…

$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$	$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$	$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$	$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$
…
5	4	2	6	18	6	6	39	31	30	2	32	44	20	6	84
6	2	4	12	19	18	2	20	32	16	6	63	45	24	6	78
7	6	2	8	20	8	6	42	33	20	4	48	46	22	4	72
…

$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$	$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$	$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$	$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$
…
5	4	2	6	18	6	6	39	31	30	2	32	44	20	6	84
6	2	4	12	19	18	2	20	32	16	6	63	45	24	6	78
7	6	2	8	20	8	6	42	33	20	4	48	46	22	4	72
…