Legendre's constant is a mathematical constant occurring in a formula constructed by Adrien-Marie Legendre to approximate the behavior of the prime-counting function
The value that corresponds precisely to its asymptotic behavior is now known to be 1.
Examination of available numerical data for known values of
led Legendre to an approximating formula.
[1][2] Today, one defines the real constant
provided that this limit exists.
Not only is it now known that the limit exists, but also that its value is equal to 1, somewhat less than Legendre's 1.08366.
Regardless of its exact value, the existence of the limit
implies the prime number theorem.
Pafnuty Chebyshev proved in 1849[3] that if the limit B exists, it must be equal to 1.
[4] It is an immediate consequence of the prime number theorem, under the precise form with an explicit estimate of the error term
(for some positive constant a, where O(...) is the big O notation), as proved in 1899 by Charles de La Vallée Poussin,[5] that B indeed is equal to 1.
(The prime number theorem had been proved in 1896, independently by Jacques Hadamard[6] and La Vallée Poussin,[7]: 183–256, 281–361 [page needed] but without any estimate of the involved error term).
Being evaluated to such a simple number has made the term Legendre's constant mostly only of historical value, with it often (technically incorrectly) being used to refer to Legendre's first guess 1.08366... instead.
(the first two columns) are known exactly; the values in the third and fourth columns are estimated using the Riemann R function.