Source: wikibot/glaisher-s-theorem
= Glaisher's theorem
{wiki=Glaisher's_theorem}
Glaisher's theorem is a result in number theory, specifically related to the distribution of prime numbers. It gives a bound on the error term in the prime number theorem. The prime number theorem states that the number of primes less than a given number \\( x \\) is asymptotically equivalent to \\( \\frac\{x\}\{\\log x\} \\). Glaisher's theorem refines the understanding of the error in this approximation.