Coinbase Support Phone Number %2B1315-2364-140 USA Helpline
(0.003 seconds)
21—30 of 844 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: Notices
…
►NIST does not provide support of any kind for software indexed in the DLMF.
…
23: 18.33 Polynomials Orthogonal on the Unit Circle
…
►See Zhedanov (1998, §2).
…
►For the hypergeometric function see §§15.1 and 15.2(i).
…
►Let be a probability measure on the unit circle of which the support is an infinite set.
…
►This states that for any sequence with and the polynomials generated by the recurrence relations (18.33.23), (18.33.24) with satisfy the orthogonality relation (18.33.17) for a unique probability measure with infinite support on the unit circle.
See Simon (2005a, p. 2, item (2)).
…
24: Bibliography M
…
►
Computational Algebra Group, School of Mathematics and Statistics, University of Sydney, Australia.
…
►
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.
…
►
On the representation of numbers as a sum of squares.
Quarterly Journal of Math. 48, pp. 93–104.
…
►
Asymptotic development of the Stirling numbers of the first kind.
J. London Math. Soc. 33, pp. 133–146.
►
Stirling numbers of the second kind.
Duke Math. J. 25 (1), pp. 29–43.
…
25: 18.2 General Orthogonal Polynomials
…
►The moments for an orthogonality measure 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 such that the absolutely continuous part has in the Szegő class .
…
►If then the interval is included in the support of , and outside the measure only has discrete mass points such that are the only possible limit points of the sequence , see Máté et al. (1991, Theorem 10).
…
►for in the support of the orthogonality measure and such that the series in (18.2.41) converges absolutely for all these .
…
26: 26.11 Integer Partitions: Compositions
…
►For example, there are eight compositions of 4: , and .
denotes the number of compositions of , and is the number of compositions into exactly
parts.
is the number of compositions of with no 1’s, where again .
…
►The Fibonacci numbers are determined recursively by
…
►Additional information on Fibonacci numbers can be found in Rosen et al. (2000, pp. 140–145).
27: 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 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, , and Fermat numbers, . …28: Bibliography K
…
►
Poly-Bernoulli numbers.
J. Théor. Nombres Bordeaux 9 (1), pp. 221–228.
…
►
The congruences of Clausen-von Staudt and Kummer for Bernoulli-Hurwitz numbers.
Math. Ann. 216 (1), pp. 1–4.
…
►
On formulas involving both the Bernoulli and Fibonacci numbers.
Scripta Math. 23, pp. 27–35.
…
►
Remark on -adic -Bernoulli numbers.
Adv. Stud. Contemp. Math. (Pusan) 1, pp. 127–136.
…
►
Algorithm 910: a portable C++ multiple-precision system for special-function calculations.
ACM Trans. Math. Software 37 (4), pp. Art. 45, 27.
…