About the Project

divisor%20function

AdvancedHelp

(0.002 seconds)

6 matching pages

1: 27.2 Functions
is the number of divisors of n and is the divisor function. It is the special case k = 2 of the function d k ( n ) that counts the number of ways of expressing n as the product of k factors, with the order of factors taken into account. …Note that σ 0 ( n ) = d ( n ) . …is the number of k -tuples of integers n whose greatest common divisor is relatively prime to n . … Table 27.2.2 tabulates the Euler totient function ϕ ( n ) , the divisor function d ( n ) ( = σ 0 ( n ) ), and the sum of the divisors σ ( n ) ( = σ 1 ( n ) ), for n = 1 ( 1 ) 52 . …
2: 26.12 Plane Partitions
Table 26.12.1: Plane partitions.
n pp ( n ) n pp ( n ) n pp ( n )
3 6 20 75278 37 903 79784
§26.12(ii) Generating Functions
where σ 2 ( j ) is the sum of the squares of the divisors of j . …
26.12.26 pp ( n ) ( ζ ( 3 ) ) 7 / 36 2 11 / 36 ( 3 π ) 1 / 2 n 25 / 36 exp ( 3 ( ζ ( 3 ) ) 1 / 3 ( 1 2 n ) 2 / 3 + ζ ( 1 ) ) ,
where ζ is the Riemann ζ -function25.2(i)). …
3: Bibliography G
  • W. Gautschi (1994) Algorithm 726: ORTHPOL — a package of routines for generating orthogonal polynomials and Gauss-type quadrature rules. ACM Trans. Math. Software 20 (1), pp. 21–62.
  • A. Gil, J. Segura, and N. M. Temme (2014) Algorithm 939: computation of the Marcum Q-function. ACM Trans. Math. Softw. 40 (3), pp. 20:1–20:21.
  • J. W. L. Glaisher (1940) Number-Divisor Tables. British Association Mathematical Tables, Vol. VIII, Cambridge University Press, Cambridge, England.
  • S. Goldstein (1927) Mathieu functions. Trans. Camb. Philos. Soc. 23, pp. 303–336.
  • Ya. I. Granovskiĭ, I. M. Lutzenko, and A. S. Zhedanov (1992) Mutual integrability, quadratic algebras, and dynamical symmetry. Ann. Phys. 217 (1), pp. 1–20.
  • 4: 26.10 Integer Partitions: Other Restrictions
    §26.10(ii) Generating Functions
    where the last right-hand side is the sum over m 0 of the generating functions for partitions into distinct parts with largest part equal to m . … where the inner sum is the sum of all positive odd divisors of t . … where the inner sum is the sum of all positive divisors of t that are in S . …
    §26.10(vi) Bessel-Function Expansion
    5: Bibliography W
  • E. L. Wachspress (2000) Evaluating elliptic functions and their inverses. Comput. Math. Appl. 39 (3-4), pp. 131–136.
  • S. S. Wagstaff (2002) Prime Divisors of the Bernoulli and Euler Numbers. In Number Theory for the Millennium, III (Urbana, IL, 2000), pp. 357–374.
  • P. L. Walker (1991) Infinitely differentiable generalized logarithmic and exponential functions. Math. Comp. 57 (196), pp. 723–733.
  • P. L. Walker (2012) Reduction formulae for products of theta functions. J. Res. Nat. Inst. Standards and Technology 117, pp. 297–303.
  • R. S. Ward (1987) The Nahm equations, finite-gap potentials and Lamé functions. J. Phys. A 20 (10), pp. 2679–2683.
  • 6: Bibliography K
  • R. B. Kearfott, M. Dawande, K. Du, and C. Hu (1994) Algorithm 737: INTLIB: A portable Fortran 77 interval standard-function library. ACM Trans. Math. Software 20 (4), pp. 447–459.
  • M. K. Kerimov (1980) Methods of computing the Riemann zeta-function and some generalizations of it. USSR Comput. Math. and Math. Phys. 20 (6), pp. 212–230.
  • A. V. Kitaev and A. H. Vartanian (2004) Connection formulae for asymptotics of solutions of the degenerate third Painlevé equation. I. Inverse Problems 20 (4), pp. 1165–1206.
  • G. A. Kolesnik (1969) An improvement of the remainder term in the divisor problem. Mat. Zametki 6, pp. 545–554 (Russian).
  • T. H. Koornwinder (2009) The Askey scheme as a four-manifold with corners. Ramanujan J. 20 (3), pp. 409–439.