Japan Airlines Reservation Number 📞850.308.3021📞

SearchAdvancedHelp

Did you mean Japan stirlingses Reservation Number 📞850.308.3021📞 ?

(0.002 seconds)

1—10 of 224 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: Bibliography O

… ►

Studies on the Painlevé equations. II. Fifth Painlevé equation $P_{\mathrm{V}}$ . Japan. J. Math. (N.S.) 13 (1), pp. 47–76.

ⓘ

External Links:

ISSN 0289-2316, MathReview (Hélène Airault), ZentralBlatt

Referenced by:

§32.10(v), §32.6(v), §32.7(viii).

Encodings:

BibTeX

… ►

Connection formulas for second-order differential equations having an arbitrary number of turning points of arbitrary multiplicities. SIAM J. Math. Anal. 8 (4), pp. 673–700.

ⓘ

External Links:

Document, MathReview (W. Wasow), ZentralBlatt

Referenced by:

§2.8(v).

Encodings:

BibTeX

… ►

Formulae and Tables, The Modified Quotients of Cylinder Functions. Technical report Technical Report UDC 517.564.3:518.25, Vol. 4, Report of the Institute of Industrial Science, University of Tokyo, Institute of Industrial Science, Chiba City, Japan.

ⓘ

Referenced by:

§10.29(i), §10.6(i).

Encodings:

BibTeX

…

3: Bibliography N

… ►

Toda equation and its solutions in special functions. J. Phys. Soc. Japan 65 (6), pp. 1589–1597.

ⓘ

External Links:

ISSN 0031-9015, Document, MathReview, ZentralBlatt

Referenced by:

§18.38(ii).

Encodings:

BibTeX

… ►

The Development of Prime Number Theory: From Euclid to Hardy and Littlewood. Springer-Verlag, Berlin.

ⓘ

External Links:

ISBN 3-540-66289-8, MathReview (D. R. Heath-Brown), ZentralBlatt

Referenced by:

§27.12.

Encodings:

BibTeX

… ►

An Introduction to the Theory of Numbers. 5th edition, John Wiley & Sons Inc., New York.

ⓘ

External Links:

ISBN 0-471-62546-9, MathReview, ZentralBlatt

Referenced by:

Ch.27.

Encodings:

BibTeX

… ►

ⓘ

Notes:

References and links to software for factorization and primality testing.

External Links:

Home Page

Referenced by:

6th item.

Encodings:

BibTeX

…

4: Bibliography Y

… ►

Computation of Kummer functions $U(a,b,x)$ for large argument $x$ by using the $\tau$-method. Trans. Inform. Process. Soc. Japan 36 (10), pp. 2335–2342 (Japanese).

ⓘ

Notes:

Japanese with English summary. Double-precision Fortran.

External Links:

ISSN 0387-5806, FullText, MathReview

Referenced by:

§13.32(ii).

Encodings:

BibTeX

…

5: Guide to Searching the DLMF

… ►

a textual word, a number, or a math symbol.

►

any double-quoted sequence of textual words and numbers.

… ►

adj, prec/n, and near/n, where n is any positive natural number.

… ► ►►►

$	stands for any number of alphanumeric characters
	(the more conventional * is reserved for the multiplication operator)
…

…

6: 1.2 Elementary Algebra

… ►The arithmetic mean of $n$ numbers $a_1,a_2,\mathrm{\dots },a_n$ is … ►The geometric mean $G$ and harmonic mean $H$ of $n$ positive numbers $a_1,a_2,\mathrm{\dots },a_n$ are given by … ►If $r$ is a nonzero real number, then the weighted mean $M(r)$ of $n$ nonnegative numbers $a_1,a_2,\mathrm{\dots },a_n$, and $n$ positive numbers $p_1,p_2,\mathrm{\dots },p_n$ with … ►The dot product notation $𝐮\cdot 𝐯$ is reserved for the physical three-dimensional vectors of (1.6.2). … ►The diagonal elements are not necessarily distinct, and the number of identical (degenerate) diagonal elements is the multiplicity of that specific eigenvalue. …

7: 26.11 Integer Partitions: Compositions

… ► $c\left(n\right)$ denotes the number of compositions of $n$, and $c_m\left(n\right)$ is the number of compositions into exactly $m$ parts. $c(\in T,n)$ is the number of compositions of $n$ with no 1’s, where again $T=\{2,3,4,\mathrm{\dots }\}$. … ►

26.11.1 $$c\left(0\right)=c(\in T,0)=1.$$

ⓘ

Symbols:

$\in$: element of, $c\left(n\right)$: number of compositions of $n$ , $c(\mathrm{condition},n)$: restricted number of compositions of $n$ and $T$: set

Permalink:

http://dlmf.nist.gov/26.11.E1

Encodings:

pMML, png, TeX

See also:

Annotations for §26.11 and Ch.26

… ►The Fibonacci numbers are determined recursively by … ►Additional information on Fibonacci numbers can be found in Rosen et al. (2000, pp. 140–145).

8: 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$. …

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

…

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

…