int valle Customer 1-201-63O-76-80 Support Number int valle heine moll

SearchAdvancedHelp

(0.002 seconds)

21—30 of 257 matching pages

21: 4.48 Software

… ►All scientific programming languages, libraries, and systems support computation of at least some of the elementary functions in standard floating-point arithmetic (§3.1(i)). …

22: Bibliography Y

… ►

Simple Variational Proof That Any Two-Dimensional Potential Well Supports at Least One Bound State. American Journal of Physics 57 (1), pp. 85–86.

ⓘ

External Links:

Document

Referenced by:

§1.18(viii).

Encodings:

BibTeX

…

23: Notices

… ►NIST does not provide support of any kind for software indexed in the DLMF. …

24: 18.2 General Orthogonal Polynomials

… ►The moments for an orthogonality measure $d\mu (x)$ are the numbers … ►are the Christoffel numbers, see also (3.5.18). … ►Nevai (1979, p.39) defined the class $𝒮$ of orthogonality measures with support inside $[-1,1]$ such that the absolutely continuous part $w(x)dx$ has $w$ in the Szegő class $𝒢$. … ►If $d\mu \in 𝐌(a,b)$ then the interval $[b-a,b+a]$ is included in the support of $d\mu$, and outside $[b-a,b+a]$ the measure $d\mu$ only has discrete mass points $x_k$ such that $b\pm a$ are the only possible limit points of the sequence $\{x_k\}$, see Máté et al. (1991, Theorem 10). … ►for $x,y$ in the support of the orthogonality measure and $z$ such that the series in (18.2.41) converges absolutely for all these $x,y$. …

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

26: 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).

27: 1.16 Distributions

… ►

§1.16(i) Test Functions

… ►The closure of the set of points where $\varphi \ne 0$ is called the support of $\varphi$. If the support of $\varphi$ is a compact set (§1.9(vii)), then $\varphi$ is called a function of compact support. A test function is an infinitely differentiable function of compact support. …

28: Bibliography K

… ►

Poly-Bernoulli numbers. J. Théor. Nombres Bordeaux 9 (1), pp. 221–228.

ⓘ

External Links:

ISSN 1246-7405, PostScript, MathReview (L. Skula), ZentralBlatt

Referenced by:

§24.16(iii).

Encodings:

BibTeX

… ►

The congruences of Clausen-von Staudt and Kummer for Bernoulli-Hurwitz numbers. Math. Ann. 216 (1), pp. 1–4.

ⓘ

External Links:

ISSN 0025-5831, Document, MathReview (M. Basmakov), ZentralBlatt

Referenced by:

§24.16(iii).

Encodings:

BibTeX

… ►

On formulas involving both the Bernoulli and Fibonacci numbers. Scripta Math. 23, pp. 27–35.

ⓘ

External Links:

MathReview (L. Carlitz), ZentralBlatt

Referenced by:

§24.15(iv).

Encodings:

BibTeX

… ►

Remark on $p$-adic $q$-Bernoulli numbers. Adv. Stud. Contemp. Math. (Pusan) 1, pp. 127–136.

ⓘ

Notes:

Algebraic number theory (Hapcheon/Saga, 1996)

External Links:

ISSN 1229-3067, MathReview (L. Skula), ZentralBlatt

Referenced by:

§24.16(iii).

Encodings:

BibTeX

… ►

Algorithm 910: a portable C++ multiple-precision system for special-function calculations. ACM Trans. Math. Software 37 (4), pp. Art. 45, 27.

ⓘ

Notes:

This system provides a uniform interface in C++, named e_float, to perform arithmetic operations and to calculate mathematical functions that are implemented in several different MP packages. It is a free, open-source, multiple precision package that allows the computation of many special functions. It supports calculations with 30….300 decimal digits and is interoperable with Microsoft’s CLR, Python and Mathematica.

External Links:

ISSN 0098-3500, Document, FullText, MathReview Entry, ZentralBlatt

Referenced by:

Erratum (V1.0.9) for References, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index.

Encodings:

BibTeX

…

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

…

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

…