About the Project

Dirichlet divisor problem

AdvancedHelp

(0.002 seconds)

3 matching pages

1: 27.11 Asymptotic Formulas: Partial Sums
§27.11 Asymptotic Formulas: Partial Sums
27.11.2 n x d ( n ) = x ln x + ( 2 γ 1 ) x + O ( x ) ,
Dirichlet’s divisor problem (unsolved as of 2022) is to determine the least number θ 0 such that the error term in (27.11.2) is O ( x θ ) for all θ > θ 0 . …
2: Errata
  • Section 27.11

    Immediately below (27.11.2), the bound θ 0 for Dirichlet’s divisor problem (currently still unsolved) has been changed from 12 37 Kolesnik (1969) to 131 416 Huxley (2003).

  • 3: Bibliography G
  • R. D. M. Garashchuk and J. C. Light (2001) Quasirandom distributed bases for bound problems. J. Chem. Phys. 114 (9), pp. 3929–3939.
  • G. Gasper (1975) Formulas of the Dirichlet-Mehler Type. In Fractional Calculus and its Applications, B. Ross (Ed.), Lecture Notes in Math., Vol. 457, pp. 207–215.
  • A. G. Gibbs (1973) Problem 72-21, Laplace transforms of Airy functions. SIAM Rev. 15 (4), pp. 796–798.
  • K. Girstmair (1990b) Dirichlet convolution of cotangent numbers and relative class number formulas. Monatsh. Math. 110 (3-4), pp. 231–256.
  • J. W. L. Glaisher (1940) Number-Divisor Tables. British Association Mathematical Tables, Vol. VIII, Cambridge University Press, Cambridge, England.