This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Hardy–Littlewood k-tuple conjecture | |
|---|---|
| Name | Hardy–Littlewood k-tuple conjecture |
| Proposer | G. H. Hardy and J. E. Littlewood |
| Date | 1923 |
| Status | Open |
| Subject | Number theory |
Hardy–Littlewood k-tuple conjecture is a central unsolved statement in analytic number theory proposing an asymptotic formula for the frequency of patterns of prime numbers described by fixed finite sets of integer offsets. It generalizes conjectures about twin primes and prime triplets and connects to major figures and institutions in 20th‑century mathematics. The conjecture has motivated extensive work by researchers at institutions such as University of Cambridge, Trinity College, Cambridge, University of Oxford, Institute for Advanced Study, and influenced developments related to Riemann hypothesis, Goldbach conjecture, and sieve methods of Atle Selberg and Alfréd Rényi.
The conjecture asserts that for any finite admissible set of nonnegative integers {h1,...,hk} there is an asymptotic formula for the counting function of integers n ≤ x for which all n+hi are prime, expressed in terms of x divided by powers of logarithms times a product over primes. This statement was formulated by G. H. Hardy and J. E. Littlewood in their sequence of papers including results presented at Royal Society venues and communicated within correspondence with contemporaries at Trinity College, Cambridge and King's College London. It refines earlier questions considered by Srinivasa Ramanujan and complements heuristic reasoning related to the distribution of zeros of the Riemann zeta function addressed by Bernhard Riemann and later developed by Atle Selberg.
A k‑tuple (h1,...,hk) that avoids modulo covering obstructions is called admissible, ensuring no prime p divides all shifted components simultaneously. Classical examples include the Twin prime conjecture pattern {0,2}, prime triplets associated to patterns considered by Alphonse de Polignac and the densest constellations studied by Paul Erdős and Erdős–Turán conjecture-style investigations. Prime constellations like prime quadruplets, sextuplets, and larger patterns have been catalogued by projects connected to PrimeGrid and researchers at University of Tennessee and University College London, drawing on computational resources at facilities such as Lawrence Livermore National Laboratory and collaborations involving Andrew Granville and Richard Crandall.
The conjectured constant multiplying the main asymptotic, known as the singular series, is an Euler product over primes reflecting local densities; its formulation uses congruence properties studied in classical work by Dirichlet on arithmetic progressions and later by Heinrich Weber and Otto G. Schilling. Hardy and Littlewood justified the form heuristically via probabilistic independence heuristics analogous to those invoked in heuristic treatments by G. H. Hardy for partition problems and by John von Neumann in statistical physics analogies. The singular series resembles products appearing in the Prime Number Theorem refinements and connects conceptually to the pair correlation statistics investigated by Hugh Montgomery and links to random matrix models studied by Freeman Dyson and Michel L. Mehta.
No nontrivial admissible k‑tuple has been proven to occur infinitely often in full generality, however significant partial progress includes bounded gaps between primes achieved by teams led by Yitang Zhang, further developments by a Polymath project coordinated by Terence Tao, and improvements using variants of the Goldston–Pintz–Yıldırım method advanced by Daniel Goldston and János Pintz. Conditional results assuming strong hypotheses such as the Generalized Riemann Hypothesis or conjectures on primes in arithmetic progressions have been obtained by authors affiliated with Princeton University, Massachusetts Institute of Technology, and University of Michigan. Sieve-theoretic and harmonic-analytic techniques from Atle Selberg-type sieves, Brun sieve refinements, and automorphic methods linked to the Langlands program have produced density estimates and existence results for special configurations.
Extensive numerical searches have been undertaken by teams including Tomás Oliveira e Silva, Oliveira e Silva collaborators, and projects at University of Tennessee Space Institute and PrimeGrid, confirming the conjectured asymptotic behavior for many specific k‑tuples up to very large bounds. Large-scale verifications exploit distributed computing and algorithms influenced by work at Bell Labs, Los Alamos National Laboratory, and academic groups at University of Bristol and University of New South Wales, producing databases of prime constellations, maximal prime gaps, and records for longest runs matching admissible patterns. These computations provide strong empirical support similar to numerical explorations of Riemann hypothesis zeros by Andrew Odlyzko and pair correlation statistics studied by Hugh Montgomery.
If true, the conjecture would imply infinitely many instances of all admissible prime constellations, resolving particular cases like the twin prime conjecture and implying consequences for additive problems linked to the Goldbach conjecture and distributional assertions related to Maier's theorem. It intersects with conjectures asserting strong forms of equidistribution such as Montgomery's pair correlation conjecture and conjectural links to random matrix theory explored by Michael Berry and Jonathan Keating. The k‑tuple conjecture also motivates study of generalized sieve axioms and influences computational number theory research programs at institutions including University of Cambridge, Stanford University, and Institute for Computational Mathematics.