Editing PrimeNumberTheorem
You are currently browsing as guest..
To change this, fill in the following fields:
Username
Password
Click here to reset your password
Who can read this page?
The World
Members
Council
Admin
You have been granted an edit lock on this page
until Thu Mar 28 14:04:33 2024.
Press
to finish editing.
Who can edit this page?
World editing disabled
Members
Council
Admin
The number of prime numbers below /x/ is asymptotic to EQN:x/\log~x or, equivalently, to the logarithmic integral EQN:Li(x). This fact is known as the "prime number theorem"; it was proved in the early 20th century by Hadamard and de la Vallee-Poussin. Informally and handwavily: "the probability that /n/ is prime is approximately EQN:1/\log(n). " (Of course this statement is nonsense if taken at face value, but for many purposes the prime numbers behave rather like random numbers selected with that density.)