Whipple theorem

SearchAdvancedHelp

(0.001 seconds)

21—30 of 126 matching pages

21: 27.2 Functions

… ►

§27.2(i) Definitions

… ►(See Gauss (1863, Band II, pp. 437–477) and Legendre (1808, p. 394).) ►This result, first proved in Hadamard (1896) and de la Vallée Poussin (1896a, b), is known as the prime number theorem. …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 …

22: 5.5 Functional Relations

… ►

§5.5(iv) Bohr–Mollerup Theorem

…

23: 19.15 Advantages of Symmetry

… ►Symmetry makes possible the reduction theorems of §19.29(i), permitting remarkable compression of tables of integrals while generalizing the interval of integration. …These reduction theorems, unknown in the Legendre theory, allow symbolic integration without imposing conditions on the parameters and the limits of integration (see §19.29(ii)). …

24: 23.23 Tables

… ►05, and in the case of $\mathrm{\wp }\left(z\right)$ the user may deduce values for complex $z$ by application of the addition theorem (23.10.1). …

25: Bibliography W

… ►

Extension of a quadratic transformation due to Whipple with an application. Adv. Difference Equ., pp. 2013:157, 8.

ⓘ

External Links:

ISSN 1687-1847, Document, FullText, MathReview (Daniele Ritelli), ZentralBlatt

Referenced by:

§16.6, §16.6.

Encodings:

BibTeX

… ►

Some transformations of generalized hypergeometric series. Proc. London Math. Soc. (2) 26 (2), pp. 257–272.

ⓘ

External Links:

Document, ZentralBlatt

Referenced by:

§16.6.

Encodings:

BibTeX

…

26: 27.11 Asymptotic Formulas: Partial Sums

… ►where $\left(h,k\right)=1$, $k>0$. ►Letting $x\to \mathrm{\infty }$ in (27.11.9) or in (27.11.11) we see that there are infinitely many primes $p\equiv h(modk)$ if $h,k$ are coprime; this is Dirichlet’s theorem on primes in arithmetic progressions. … ►

27.11.15 $$\underset{x\to \mathrm{\infty }}{lim}\sum _{n\le x}\frac{\mu \left(n\right)\ln n}{n}=-1.$$

ⓘ

Symbols:

$\mu \left(n\right)$: Möbius function, $\ln z$: principal branch of logarithm function, $n$: positive integer and $x$: real number

A&S Ref:

24.3.1 III

Referenced by:

§27.11, §27.11

Permalink:

http://dlmf.nist.gov/27.11.E15

Encodings:

pMML, png, TeX

Change of Notation (effective with 1.0.10):

The notation for logarithm has been changed to $\ln$ from $\log$.

See also:

Annotations for §27.11 and Ch.27

►Each of (27.11.13)–(27.11.15) is equivalent to the prime number theorem (27.2.3). The prime number theorem for arithmetic progressions—an extension of (27.2.3) and first proved in de la Vallée Poussin (1896a, b)—states that if $\left(h,k\right)=1$, then the number of primes $p\le x$ with $p\equiv h(modk)$ is asymptotic to $x/(\varphi \left(k\right)\ln x)$ as $x\to \mathrm{\infty }$.

27: 27.12 Asymptotic Formulas: Primes

… ►

Prime Number Theorem

…

28: 1.10 Functions of a Complex Variable

… ►

Picard’s Theorem

… ►

§1.10(iv) Residue Theorem

… ►

Rouché’s Theorem

… ►

Lagrange Inversion Theorem

… ►

Extended Inversion Theorem

…

29: 1.4 Calculus of One Variable

… ►

Mean Value Theorem

… ►

Fundamental Theorem of Calculus

… ►

First Mean Value Theorem

… ►

Second Mean Value Theorem

… ►

§1.4(vi) Taylor’s Theorem for Real Variables

…

30: 35.2 Laplace Transform

… ►

Convolution Theorem

…