Fiat Wallet Customer 1-201-63O-7680 Care Number Fiat Wallet Support Number

(0.004 seconds)

11—20 of 247 matching pages

11: 27.18 Methods of Computation: Primes

§27.18 Methods of Computation: Primes

►An overview of methods for precise counting of the number of primes not exceeding an arbitrary integer

x

is given in Crandall and Pomerance (2005, §3.7). …An analytic approach using a contour integral of the Riemann zeta function (§25.2(i)) is discussed in Borwein et al. (2000). … ►These algorithms are used for testing primality of Mersenne numbers,

2^{n}-1

, and Fermat numbers,

2^{2^{n}}+1

. …

12: 19.11 Addition Theorems

… ►

19.11.6_5

R_{C}\left(\gamma-\delta,\gamma\right)=\frac{-1}{\sqrt{\delta}}\operatorname{% arctan}\left(\frac{\sqrt{\delta}\sin\theta\sin\phi\sin\psi}{\alpha^{2}-1-% \alpha^{2}\cos\theta\cos\phi\cos\psi}\right).

ⓘ

Symbols:: $R_{C}\left(\NVar{x},\NVar{y}\right)$ : Carlson’s combination of inverse circular and inverse hyperbolic functions, $\cos\NVar{z}$ : cosine function, $\operatorname{arctan}\NVar{z}$ : arctangent function, $\sin\NVar{z}$ : sine function, $\phi$ : real or complex argument, $\alpha^{2}$ : real or complex parameter, $\theta$ : amplitude, $\psi$ : angle, $\gamma$ and $\delta$
Referenced by:: §19.11(i), Erratum (V1.0.28) for Equations (15.2.3_5), (19.11.6_5)
Permalink:: http://dlmf.nist.gov/19.11.E6_5
Encodings:: pMML, png, TeX
Clarification (effective with 1.0.28):: This equation was given a number.
See also:: Annotations for §19.11(i), §19.11 and Ch.19

►Hence, care has to be taken with the multivalued functions in (19.11.5). …

13: Mathematical Introduction

… ►The NIST Handbook has essentially the same objective as the Handbook of Mathematical Functions that was issued in 1964 by the National Bureau of Standards as Number 55 in the NBS Applied Mathematics Series (AMS). … ►Particular care is taken with topics that are not dealt with sufficiently thoroughly from the standpoint of this Handbook in the available literature. … ► ►►►►

$(a,b]$ or $[a,b)$	half-closed intervals.
…
$\mathbb{N}$	set of all positive integers.
…
$\mathbb{Q}$	set of all rational numbers.
…

… ►For equations or other technical information that appeared previously in AMS 55, the DLMF usually includes the corresponding AMS 55 equation number, or other form of reference, together with corrections, if needed. …

14: 26.6 Other Lattice Path Numbers

§26.6 Other Lattice Path Numbers

… ►

Delannoy Number $D(m,n)$

… ►

Motzkin Number $M(n)$

… ►

Narayana Number $N(n,k)$

… ►

§26.6(iv) Identities

…

15: 24.15 Related Sequences of Numbers

§24.15 Related Sequences of Numbers

►

§24.15(i) Genocchi Numbers

… ►

§24.15(ii) Tangent Numbers

… ►

§24.15(iii) Stirling Numbers

… ►

§24.15(iv) Fibonacci and Lucas Numbers

…

16: 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

…

17: 26.14 Permutations: Order Notation

… ►As an example,

35247816

is an element of

\mathfrak{S}_{8}.

The inversion number is the number of pairs of elements for which the larger element precedes the smaller: … ► ►The Eulerian number, denoted

\genfrac{<}{>}{0.0pt}{}{n}{k}

, is the number of permutations in

\mathfrak{S}_{n}

with exactly

k

descents. …The Eulerian number

\genfrac{<}{>}{0.0pt}{}{n}{k}

is equal to the number of permutations in

\mathfrak{S}_{n}

with exactly

k

excedances. … ►

§26.14(iii) Identities

…

18: 26.7 Set Partitions: Bell Numbers

§26.7 Set Partitions: Bell Numbers

►

§26.7(i) Definitions

… ►

§26.7(ii) Generating Function

… ►

§26.7(iii) Recurrence Relation

… ►

§26.7(iv) Asymptotic Approximation

…

19: 26.8 Set Partitions: Stirling Numbers

§26.8 Set Partitions: Stirling Numbers

►

§26.8(i) Definitions

… ► … ►

§26.8(v) Identities

… ►

§26.8(vi) Relations to Bernoulli Numbers

…

20: 24.19 Methods of Computation

… ►

§24.19(i) Bernoulli and Euler Numbers and Polynomials

►Equations (24.5.3) and (24.5.4) enable

B_{n}

and

E_{n}

to be computed by recurrence. …A similar method can be used for the Euler numbers based on (4.19.5). … ►

§24.19(ii) Values of $B_{n}$ Modulo $p$

… ►We list here three methods, arranged in increasing order of efficiency. …