The Prime Number Theorem is an asymptotic result that says, as n approaches infinity, the number of primes less than or equal to n is approximately n/log n.
The Prime Number Theorem is an asymptotic result that says, as n approaches infinity, the number of primes less than or equal to n is approximately n/log n.