Hardy–Littlewood conjectures
E120396
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.
All labels observed (9)
How this entity was disambiguated
This entity first appeared as the object of triple T1060258 — 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: Hardy–Littlewood conjectures Context triple: [G. H. Hardy, knownFor, Hardy–Littlewood conjectures]
-
A.
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.
-
B.
Ü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.
-
C.
Gauss’s lemma in number theory
Gauss’s lemma in number theory is a result that relates the Legendre symbol to the number of sign changes in a certain sequence of multiples, providing a practical criterion for determining quadratic residues modulo an odd prime.
-
D.
Dyson’s transform in number theory
Dyson’s transform in number theory is a combinatorial technique introduced by Freeman Dyson to manipulate and relate integer partitions, particularly in the study of partition identities and congruences.
-
E.
Riemann–Siegel formula
The Riemann–Siegel formula is an asymptotic expression that efficiently approximates the Riemann zeta function on the critical line, playing a key role in the numerical study of its zeros.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: Hardy–Littlewood conjectures Target entity description: 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.
-
A.
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.
-
B.
Ü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.
-
C.
Gauss’s lemma in number theory
Gauss’s lemma in number theory is a result that relates the Legendre symbol to the number of sign changes in a certain sequence of multiples, providing a practical criterion for determining quadratic residues modulo an odd prime.
-
D.
Dyson’s transform in number theory
Dyson’s transform in number theory is a combinatorial technique introduced by Freeman Dyson to manipulate and relate integer partitions, particularly in the study of partition identities and congruences.
-
E.
Riemann–Siegel formula
The Riemann–Siegel formula is an asymptotic expression that efficiently approximates the Riemann zeta function on the critical line, playing a key role in the numerical study of its zeros.
- F. None of above. chosen
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
mathematical conjecture
ⓘ
result in analytic number theory ⓘ unproven hypothesis ⓘ |
| appliesTo |
Hardy–Littlewood conjectures
self-linksurface differs
ⓘ
surface form:
Goldbach-type problems
prime constellations ⓘ prime k-tuples ⓘ twin primes ⓘ |
| assumes | admissibility of k-tuple pattern ⓘ |
| concerns |
asymptotic density of primes in linear patterns
ⓘ
correlations between prime numbers ⓘ |
| describedIn | Acta Mathematica ⓘ |
| era | 20th century mathematics ⓘ |
| field |
analytic number theory
ⓘ
number theory ⓘ |
| formulatedBy |
G. H. Hardy
ⓘ
John Edensor Littlewood ⓘ
surface form:
J. E. Littlewood
|
| generalizes | prime number theorem ⓘ |
| hasConsequence |
heuristics for distribution of primes in arithmetic progressions
ⓘ
quantitative estimates for prime constellations ⓘ |
| hasPart |
Hardy–Littlewood conjectures
self-linksurface differs
ⓘ
surface form:
Hardy–Littlewood conjecture F
Hardy–Littlewood conjectures self-linksurface differs ⓘ
surface form:
Hardy–Littlewood conjecture G
Hardy–Littlewood conjectures self-linksurface differs ⓘ
surface form:
Hardy–Littlewood first conjecture
Hardy–Littlewood conjectures self-linksurface differs ⓘ
surface form:
Hardy–Littlewood prime k-tuple conjecture
Hardy–Littlewood conjectures self-linksurface differs ⓘ
surface form:
Hardy–Littlewood second conjecture
|
| implies |
infinitely many prime k-tuples of admissible patterns
ⓘ
infinitely many twin primes (under suitable form) ⓘ |
| influenced |
development of sieve methods
ⓘ
research on Goldbach conjecture ⓘ research on twin prime conjecture ⓘ |
| language | mathematical notation ⓘ |
| mainTheme |
distribution of prime constellations
ⓘ
distribution of prime numbers ⓘ |
| mathematicalDomain |
additive number theory
ⓘ
multiplicative number theory ⓘ |
| namedAfter |
G. H. Hardy
ⓘ
John Edensor Littlewood ⓘ
surface form:
J. E. Littlewood
|
| predicts |
frequency of prime gaps of given size
ⓘ
precise constants in prime k-tuple counts ⓘ |
| relatedTo |
Bateman–Horn conjecture
ⓘ
Goldbach conjecture ⓘ Riemann hypothesis ⓘ twin prime conjecture ⓘ |
| status | unproven ⓘ |
| usesConcept |
asymptotic formula
ⓘ
prime counting function ⓘ singular series ⓘ |
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: Hardy–Littlewood conjectures Description of subject: 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.
Referenced by (12)
Full triples — surface form annotated when it differs from this entity's canonical label.