In number theory, the prime number theorem (PNT) describes the asymptotic distribution of the prime numbers. The prime number theorem gives a general description of how the primes are distributed amongst the positive integers.
Informally speaking, the prime number theorem states that if a random integer is selected in the range of zero to some large integer N, the probability that the selected integer is prime is about 1 / ln(N), where ln(N) is the natural logarithm of N. For example, among the positive integers up to and including N = 103 about one in seven numbers is prime, whereas up to and including N = 1010 about one in 23 numbers is prime (where ln(103)= 6.90775528. and ln(1010)=23.0258509). In other words, the average gap between consecutive prime numbers among the first N integers is roughly ln(N).
Read more about Prime Number Theorem: Statement of The Theorem, History of The Asymptotic Law of Distribution of Prime Numbers and Its Proof, Proof Methodology, Proof Sketch, Prime-counting Function in Terms of The Logarithmic Integral, Elementary Proofs, Computer Verifications, Prime Number Theorem For Arithmetic Progressions, Bounds On The Prime-counting Function, Approximations For The nth Prime Number, Table of π(x), x / Ln x, and Li(x), Analogue For Irreducible Polynomials Over A Finite Field
Famous quotes containing the words prime, number and/or theorem:
“I did not know I was in my prime until afterwards.”
—Mason Cooley (b. 1927)
“The poetic act consists of suddenly seeing that an idea splits up into a number of equal motifs and of grouping them; they rhyme.”
—Stéphane Mallarmé (1842–1898)
“To insure the adoration of a theorem for any length of time, faith is not enough, a police force is needed as well.”
—Albert Camus (1913–1960)