number%20of

SearchAdvancedHelp

(0.002 seconds)

1—10 of 42 matching pages

1: 27.15 Chinese Remainder Theorem

… ►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 $(modm)$, which is correct to 20 digits. …

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

3: 26.14 Permutations: Order Notation

… ►As an example, $35247816$ is an element of ${𝔖}_8.$ The inversion number is the number of pairs of elements for which the larger element precedes the smaller: … ► ►The Eulerian number, denoted , is the number of permutations in ${𝔖}_n$ with exactly $k$ descents. …The Eulerian number is equal to the number of permutations in ${𝔖}_n$ with exactly $k$ excedances. … ►

§26.14(iii) Identities

…

4: Bibliography C

… ►

Asymptotic estimates for generalized Stirling numbers. Analysis (Munich) 20 (1), pp. 1–13.

ⓘ

External Links:

ISSN 0174-4747, MathReview (F. T. Howard), ZentralBlatt

Referenced by:

§26.8(vii).

Encodings:

BibTeX

…

5: Bibliography L

… ►

An asymptotic estimate for the Bernoulli and Euler numbers. Canad. Math. Bull. 20 (1), pp. 109–111.

ⓘ

External Links:

MathReview (D. H. Lehmer), ZentralBlatt

Referenced by:

§24.11.

Encodings:

BibTeX

…

6: 26.13 Permutations: Cycle Notation

… ►The Stirling cycle numbers of the first kind, denoted by $\left[\genfrac{}{}{0.0pt}{}{n}{k}\right]$, count the number of permutations of $\{1,2,\mathrm{\dots },n\}$ with exactly $k$ cycles. They are related to Stirling numbers of the first kind by …See §26.8 for generating functions, recurrence relations, identities, and asymptotic approximations. … ►The derangement number, $d(n)$, is the number of elements of ${𝔖}_n$ with no fixed points: … ►A permutation is even or odd according to the parity of the number of transpositions. …

7: 25.6 Integer Arguments

… ►

25.6.3 $$\zeta \left(-n\right)=-\frac{B_{n+1}}{n+1},$$ $n=1,2,3,\mathrm{\dots }$.

ⓘ

Symbols:

$B_n$: Bernoulli numbers, $\zeta \left(s\right)$: Riemann zeta function and $n$: nonnegative integer

Source:

Apostol (1976, (20), p. 266); with $n\ne 0$

A&S Ref:

23.2.15 (in slightly different form)

Permalink:

http://dlmf.nist.gov/25.6.E3

Encodings:

pMML, png, TeX

See also:

Annotations for §25.6(i), §25.6 and Ch.25

…

8: 27.2 Functions

… ►where $p_1,p_2,\mathrm{\dots },p_{\nu \left(n\right)}$ are the distinct prime factors of $n$, each exponent $a_r$ is positive, and $\nu \left(n\right)$ is the number of distinct primes dividing $n$. …Euclid’s Elements (Euclid (1908, Book IX, Proposition 20)) gives an elegant proof that there are infinitely many primes. … ►(See Gauss (1863, Band II, pp. 437–477) and Legendre (1808, p. 394).) … ► … ►

§27.2(ii) Tables

…

9: 26.5 Lattice Paths: Catalan Numbers

§26.5 Lattice Paths: Catalan Numbers

►

§26.5(i) Definitions

► $C\left(n\right)$ is the Catalan number. … ►

§26.5(ii) Generating Function

… ►

§26.5(iii) Recurrence Relations

…

10: 6.16 Mathematical Applications

… ►

§6.16(ii) Number-Theoretic Significance of $\mathrm{li}\left(x\right)$

►If we assume Riemann’s hypothesis that all nonreal zeros of $\zeta \left(s\right)$ have real part of $\frac{1}{2}$ (§25.10(i)), then ►

6.16.5 $$\mathrm{li}\left(x\right)-\pi (x)=O\left(\sqrt{x}\ln x\right),$$ $x\to \mathrm{\infty }$,

ⓘ

Symbols:

$O\left(x\right)$: order not exceeding, $\mathrm{li}\left(x\right)$: logarithmic integral, $\ln z$: principal branch of logarithm function, $x$: real variable and $\pi (x)$: number of primes $\le x$

A&S Ref:

5.1.50

Permalink:

http://dlmf.nist.gov/6.16.E5

Encodings:

pMML, png, TeX

See also:

Annotations for §6.16(ii), §6.16 and Ch.6

►where $\pi (x)$ is the number of primes less than or equal to $x$. … ►

►►

Figure 6.16.2: The logarithmic integral $\mathrm{li}\left(x\right)$, together with vertical bars indicating the value of $\pi (x)$ for $x=10,20,\mathrm{\dots },1000$. Magnify