prime number theorem
E259759
The prime number theorem is a fundamental result in number theory that describes how prime numbers become less frequent and provides an approximate formula for the number of primes less than a given large number.
All labels observed (2)
| Label | Occurrences |
|---|---|
| prime number theorem canonical | 6 |
| Prime Number Theorem | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T2364378 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
Target entity: prime number theorem Context triple: [Riemann hypothesis, relatedTo, prime number theorem]
-
A.
Über die Anzahl der Primzahlen unter einer gegebenen Grösse
Über die Anzahl der Primzahlen unter einer gegebenen Grösse is Bernhard Riemann’s seminal 1859 paper that introduced the Riemann zeta function and laid the foundations of analytic number theory, including the famous Riemann Hypothesis.
-
B.
Riemann hypothesis
The Riemann hypothesis is a famous unsolved conjecture in number theory asserting that all nontrivial zeros of the Riemann zeta function lie on a critical line in the complex plane, with deep implications for the distribution of prime numbers.
-
C.
Hardy–Littlewood conjectures
The Hardy–Littlewood conjectures are a collection of influential unproven hypotheses in analytic number theory that generalize the prime number theorem to describe the distribution of prime numbers and prime constellations.
-
D.
Selberg sieve
The Selberg sieve is a powerful analytic number theory method developed by Atle Selberg for estimating the size of sets of integers filtered by divisibility conditions, particularly in the study of prime numbers.
-
E.
Chebotarev density theorem
The Chebotarev density theorem is a fundamental result in algebraic number theory that generalizes the prime number theorem to describe how often primes in a number field have a given Frobenius conjugacy class in its Galois group.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: prime number theorem Target entity description: The prime number theorem is a fundamental result in number theory that describes how prime numbers become less frequent and provides an approximate formula for the number of primes less than a given large number.
-
A.
Über die Anzahl der Primzahlen unter einer gegebenen Grösse
Über die Anzahl der Primzahlen unter einer gegebenen Grösse is Bernhard Riemann’s seminal 1859 paper that introduced the Riemann zeta function and laid the foundations of analytic number theory, including the famous Riemann Hypothesis.
-
B.
Riemann hypothesis
The Riemann hypothesis is a famous unsolved conjecture in number theory asserting that all nontrivial zeros of the Riemann zeta function lie on a critical line in the complex plane, with deep implications for the distribution of prime numbers.
-
C.
Hardy–Littlewood conjectures
The Hardy–Littlewood conjectures are a collection of influential unproven hypotheses in analytic number theory that generalize the prime number theorem to describe the distribution of prime numbers and prime constellations.
-
D.
Selberg sieve
The Selberg sieve is a powerful analytic number theory method developed by Atle Selberg for estimating the size of sets of integers filtered by divisibility conditions, particularly in the study of prime numbers.
-
E.
Chebotarev density theorem
The Chebotarev density theorem is a fundamental result in algebraic number theory that generalizes the prime number theorem to describe how often primes in a number field have a given Frobenius conjugacy class in its Galois group.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
mathematical theorem
ⓘ
result in analytic number theory ⓘ |
| approximation | π(x) ≈ li(x) ⓘ |
| approximationQuality | improves as x tends to infinity ⓘ |
| concernsSet | set of prime numbers ⓘ |
| describes | asymptotic distribution of prime numbers ⓘ |
| domain | positive real numbers x ⓘ |
| elementaryProofBy |
Atle Selberg
ⓘ
Pál Erdős ⓘ
surface form:
Paul Erdős
|
| elementaryProofYear | 1949 ⓘ |
| equivalentTo | ψ(x) ~ x ⓘ |
| field |
analytic number theory
ⓘ
number theory ⓘ |
| firstProofBy |
Charles-Jean de la Vallée Poussin
ⓘ
Jacques Hadamard ⓘ |
| generalizedTo |
Chebotarev density theorem
ⓘ
prime number theorem for arithmetic progressions ⓘ |
| hasConsequence |
average gap between consecutive primes near x is about log x
ⓘ
proportion of numbers up to x that are prime is about 1 / log x ⓘ |
| hasElementaryProof | yes ⓘ |
| historicalConjectureBy |
Adrien-Marie Legendre
ⓘ
Carl Friedrich Gauss ⓘ |
| implies | density of primes near x is about 1 / log x ⓘ |
| involvesFunction |
Chebyshev functions
ⓘ
surface form:
Chebyshev function ψ(x)
natural logarithm log x ⓘ prime-counting function π(x) ⓘ |
| language | mathematical notation ⓘ |
| namedAfter | prime numbers ⓘ |
| predecessorResult | Chebyshev’s estimates for π(x) ⓘ |
| provedIndependentlyBy |
Charles-Jean de la Vallée Poussin
ⓘ
Jacques Hadamard ⓘ |
| publicationYear | 1896 ⓘ |
| refinedBy |
error term estimates for π(x)
ⓘ
logarithmic integral li(x) ⓘ |
| relatedConcept |
Dirichlet's theorem on arithmetic progressions
ⓘ
surface form:
Dirichlet’s theorem on arithmetic progressions
Mertens’ theorems ⓘ distribution of primes in short intervals ⓘ prime gaps ⓘ |
| relatedTo |
Riemann hypothesis
ⓘ
Riemann zeta function ⓘ |
| states | the number of primes less than x is asymptotic to x / log x ⓘ |
| symbolicForm | π(x) ~ x / log x ⓘ |
| topicOf | many advanced textbooks in analytic number theory ⓘ |
| type | asymptotic formula ⓘ |
| usesTool |
complex analysis
ⓘ
non-vanishing of the Riemann zeta function on the line Re(s) = 1 ⓘ properties of the Riemann zeta function ⓘ |
| yearProved | 1896 ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Subject: prime number theorem Description of subject: The prime number theorem is a fundamental result in number theory that describes how prime numbers become less frequent and provides an approximate formula for the number of primes less than a given large number.
Referenced by (7)
Full triples — surface form annotated when it differs from this entity's canonical label.