About the Project

Fiat Wallet Customer 1-201-63O-7680 Support Number Fiat Wallet Helpline Toll

AdvancedHelp

(0.005 seconds)

21—30 of 241 matching pages

21: Notices
NIST does not provide support of any kind for software indexed in the DLMF. …
22: Bibliography M
  • Magma (website) Computational Algebra Group, School of Mathematics and Statistics, University of Sydney, Australia.
  • A. Máté, P. Nevai, and W. Van Assche (1991) 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.
  • L. J. Mordell (1917) On the representation of numbers as a sum of 2 r squares. Quarterly Journal of Math. 48, pp. 93–104.
  • L. Moser and M. Wyman (1958a) Asymptotic development of the Stirling numbers of the first kind. J. London Math. Soc. 33, pp. 133–146.
  • L. Moser and M. Wyman (1958b) Stirling numbers of the second kind. Duke Math. J. 25 (1), pp. 29–43.
  • 23: 18.2 General Orthogonal Polynomials
    The moments for an orthogonality measure d μ ( x ) are the numbersare 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 ) d x has w in the Szegő class 𝒢 . … If d μ 𝐌 ( a , b ) then the interval [ b a , b + a ] is included in the support of d μ , and outside [ b a , b + a ] the measure d μ only has discrete mass points x k such that b ± 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 . …
    24: 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 . …
    25: 26.11 Integer Partitions: Compositions
    c ( n ) denotes the number of compositions of n , and c m ( n ) is the number of compositions into exactly m parts. c ( T , n ) is the number of compositions of n with no 1’s, where again T = { 2 , 3 , 4 , } . …
    26.11.1 c ( 0 ) = c ( T , 0 ) = 1 .
    The Fibonacci numbers are determined recursively by … Additional information on Fibonacci numbers can be found in Rosen et al. (2000, pp. 140–145).
    26: 1.16 Distributions
    §1.16(i) Test Functions
    The closure of the set of points where ϕ 0 is called the support of ϕ . If the support of ϕ is a compact set (§1.9(vii)), then ϕ is called a function of compact support. A test function is an infinitely differentiable function of compact support. …
    27: Bibliography K
  • M. Kaneko (1997) Poly-Bernoulli numbers. J. Théor. Nombres Bordeaux 9 (1), pp. 221–228.
  • N. M. Katz (1975) The congruences of Clausen-von Staudt and Kummer for Bernoulli-Hurwitz numbers. Math. Ann. 216 (1), pp. 1–4.
  • R. P. Kelisky (1957) On formulas involving both the Bernoulli and Fibonacci numbers. Scripta Math. 23, pp. 27–35.
  • T. Kim and H. S. Kim (1999) Remark on p -adic q -Bernoulli numbers. Adv. Stud. Contemp. Math. (Pusan) 1, pp. 127–136.
  • C. Kormanyos (2011) Algorithm 910: a portable C++ multiple-precision system for special-function calculations. ACM Trans. Math. Software 37 (4), pp. Art. 45, 27.
  • 28: 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
    29: 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
    30: 26.5 Lattice Paths: Catalan Numbers
    §26.5 Lattice Paths: Catalan Numbers
    §26.5(i) Definitions
    C ( n ) is the Catalan number. …
    §26.5(ii) Generating Function
    §26.5(iii) Recurrence Relations