Mathematics Atlas

How Proof Is Made
Theorems

Prime Number Theorem

Also Known As PNT
Number Theory

Citation Formats

General Reference

APA Style

BibTeX

Step Count Approaching a Smooth Curve

The prime number theorem describes how prime numbers are distributed among the positive integers. It formalizes the intuitive idea that primes become less common as they become larger by precisely quantifying the rate at which this occurs.

Facts
Statement
The number of primes less than or equal to x, written pi(x), grows asymptotically like x divided by the natural logarithm of x, so their ratio approaches 1 as x grows large; equivalently, the average gap between consecutive primes near N is roughly the natural logarithm of N. 1
Proof Year
1896 1
Cross-Tradition Connections

In Branch

Proved By

Sources
1. Prime Number Theorem (Wikipedia)
Wikimedia Foundationlead paragraph
Quote, lead paragraph
It formalizes the intuitive idea that primes become less common as they become larger by precisely quantifying the rate at which this occurs.
View the Source
1. Prime Number Theorem (Wikipedia)
Wikimedia Foundationbody text
Quote, body text
the average gap between consecutive prime numbers among the first N integers is roughly log(N)
View the Source
1. Prime Number Theorem (Wikipedia)
Wikimedia Foundationhistory section
Quote, history section
independently proved by Jacques Hadamard and Charles Jean de la Vallee Poussin in 1896
View the Source
1. Prime Number Theorem (Wikipedia)
Wikimedia Foundationlead section
Quote, lead section
the prime number theorem (PNT) describes the asymptotic distribution of prime numbers among the positive integers.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0 open reader challenges)
No disputes yet. Spotted an error or a better source? Open the first one.

View At A Past Year

The atlas records no dated fact of its own for this entry, so there is no other year to choose.