Zelle usa support number 205↹892↹1862 toll free

SearchAdvancedHelp

(0.002 seconds)

21—30 of 258 matching pages

21: 19 Elliptic Integrals

…

22: Ronald F. Boisvert

… ►His research interests include numerical solution of partial differential equations, mathematical software, and information services that support computational science. …

23: Bruce R. Miller

… ►While developing the supporting theories, he discovered a passion for symbolic computation and computer algebra. …

24: Jim Pitman

… ►org and to provide technical support to other organizations willing to do the same. …

25: Bibliography M

… ►

Computational Algebra Group, School of Mathematics and Statistics, University of Sydney, Australia.

ⓘ

Notes:

A software package (the successor to CAYLEY) designed to solve computationally hard problems in algebra, number theory, geometry, and combinatorics, and to provide a mathematically rigorous environment for computing with algebraic, number-theoretic, combinatoric, and geometric objects.

External Links:

Magma

Referenced by:

4th item.

Encodings:

BibTeX

… ►

The supports of measures associated with orthogonal polynomials and the spectra of the related selfadjoint operators. Rocky Mountain J. Math. 21 (1), pp. 501–527.

ⓘ

External Links:

ISSN 0035-7596, Document, Link, MathReview (T. S. Chihara)

Referenced by:

§18.2(xi).

Encodings:

BibTeX

… ►

ⓘ

Notes:

System for the manipulation of symbolic and numerical expressions. Includes a collection of special functions. Utilizes exact fractions, arbitrary precision integers, and arbitrary precision floating point numbers.

External Links:

Home Page

Referenced by:

§ ‣ 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

… ►

On the representation of numbers as a sum of $2r$ squares. Quarterly Journal of Math. 48, pp. 93–104.

ⓘ

External Links:

ZentralBlatt

Referenced by:

§27.13(iv).

Encodings:

BibTeX

… ►

Asymptotic development of the Stirling numbers of the first kind. J. London Math. Soc. 33, pp. 133–146.

ⓘ

External Links:

Document, MathReview (N. J. Fine), ZentralBlatt

Referenced by:

§26.1, §26.8(vii).

Encodings:

BibTeX

…

26: Foreword

… ►Particular attention is called to the generous support of the National Science Foundation, which made possible the participation of experts from academia and research institutes worldwide. …

27: 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)). …

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

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

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