Siteadmin, Bureaucrats, Check users, nsAm_Govt_101RO, nsAm_Govt_101RW, nsAm_Govt_101_ta, nsJudgesRO, nsJudgesRW, nsJudges_talkRO, nsJudges_talkRW, nsTeam2RO, nsTeam2RW, nsTeam2_talkRO, nsTeam2_talkRW, oversight, Administrators
125,794
edits
Changes
Jump to navigation
Jump to search
mLine 1:
Line 1: − +
dewikify
The '''Prime Number Theorem''' is one of the most famous theorems in mathematics. It states that the number of primes not exceeding n is [[asymptotic]] to <math>\frac{n}{\log(n)}</math>, where log(n) is the logarithm of (n) to the base e.
The '''Prime Number Theorem''' is one of the most famous theorems in mathematics. It states that the number of primes not exceeding n is asymptotic to <math>\frac{n}{\log(n)}</math>, where log(n) is the logarithm of (n) to the base e.
:<math>\pi(n)\sim\frac{n}{\ln n}</math>.
:<math>\pi(n)\sim\frac{n}{\ln n}</math>.