Bertrand's postulate
E1094038
UNEXPLORED
Bertrand's postulate is a theorem in number theory stating that for every integer n > 1 there is always at least one prime number strictly between n and 2n.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Bertrand's postulate canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T14334492 — 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.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Bertrand's postulate Context triple: [Ramanujan prime, relatedTo, Bertrand's postulate]
-
A.
Dirichlet's theorem on arithmetic progressions
Dirichlet's theorem on arithmetic progressions is a fundamental result in number theory stating that any arithmetic progression with first term and difference coprime contains infinitely many prime numbers.
-
B.
Bateman–Horn conjecture
The Bateman–Horn conjecture is a far-reaching unproven statement in number theory that predicts how often sets of polynomial expressions simultaneously take prime values, generalizing several earlier conjectures about the distribution of prime numbers.
-
C.
Ü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.
-
D.
Siegel–Walfisz theorem
The Siegel–Walfisz theorem is a result in analytic number theory that gives strong uniform estimates for the distribution of prime numbers in arithmetic progressions with relatively small moduli.
-
E.
Legendre’s conjecture on primes between consecutive squares
Legendre’s conjecture on primes between consecutive squares is an unproven statement in number theory asserting that there is always at least one prime number between any two consecutive perfect squares.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Bertrand's postulate Target entity description: Bertrand's postulate is a theorem in number theory stating that for every integer n > 1 there is always at least one prime number strictly between n and 2n.
-
A.
Dirichlet's theorem on arithmetic progressions
Dirichlet's theorem on arithmetic progressions is a fundamental result in number theory stating that any arithmetic progression with first term and difference coprime contains infinitely many prime numbers.
-
B.
Bateman–Horn conjecture
The Bateman–Horn conjecture is a far-reaching unproven statement in number theory that predicts how often sets of polynomial expressions simultaneously take prime values, generalizing several earlier conjectures about the distribution of prime numbers.
-
C.
Ü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.
-
D.
Siegel–Walfisz theorem
The Siegel–Walfisz theorem is a result in analytic number theory that gives strong uniform estimates for the distribution of prime numbers in arithmetic progressions with relatively small moduli.
-
E.
Legendre’s conjecture on primes between consecutive squares
Legendre’s conjecture on primes between consecutive squares is an unproven statement in number theory asserting that there is always at least one prime number between any two consecutive perfect squares.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.