Hardy–Littlewood conjectures (prime k-tuples)

Hardy–Littlewood conjectures (prime k-tuples)
Name	Hardy–Littlewood conjectures (prime k-tuples)
Proposed	1923
Proposers	G. H. Hardy; J. E. Littlewood
Field	Number theory
Status	Open

Hardy–Littlewood conjectures (prime k-tuples)

The Hardy–Littlewood conjectures on prime k-tuples are a set of conjectural asymptotic predictions about the distribution of clusters of prime numbers formulated by G. H. Hardy and J. E. Littlewood; they extend earlier questions posed by Srinivasa Ramanujan and relate to problems considered by Christian Goldbach and Pierre de Fermat. These conjectures connect to major themes in analytic number theory, touch on methods associated with Riemann hypothesis, and motivate computational work by projects such as the Great Internet Mersenne Prime Search and investigations by researchers at institutions like University of Cambridge, Trinity College, Cambridge, and University of Oxford.

Statement of the conjectures

Hardy and Littlewood formulated a family of conjectures predicting counts for prime constellations analogous to conjectures about twin primes linked to the historical Twin prime conjecture and conjectures inspired by results of Paul Erdős and Atle Selberg. In their second paper of 1923 they proposed an asymptotic formula for the number of integers n ≤ x for which a given admissible k-tuple of linear forms all produce primes; this relates to the analytic framework developed by Johann Peter Gustav Lejeune Dirichlet, Bernhard Riemann, and later refined by Harald Cramér and Aleksandr Selberg. The conjectures invoke a multiplicative correction factor later called the singular series, echoing ideas present in the work of Godfrey Harold Hardy and reflecting influences from Cambridge number-theoretical circles including John Edensor Littlewood's collaborations.

Prime k-tuples and admissible constellations

A prime k-tuple or k-constellation is a finite set of integer offsets {h1, h2, ..., hk} giving linear forms n+hi; admissibility requires that for every prime p the set {h1 mod p, ..., hk mod p} does not exhaust all residue classes modulo p, a condition connected historically to work by Dirichlet on arithmetic progressions and to obstruction phenomena studied by Émile Borel and André Weil. Typical examples include the Twin prime conjecture offsets {0,2}, the triple offsets related to patterns considered by Srinivasa Ramanujan, and longer constellations linked to records and data compiled by groups associated with Maximilian A. Hejhal and other computational number theorists. The admissibility criterion can be tested using modular arithmetic techniques developed in the tradition of Carl Friedrich Gauss and implemented in software by teams at Princeton University and Massachusetts Institute of Technology.

Prime k-tuple conjecture and singular series

The k-tuple conjecture asserts that an admissible k-tuple H = {h1,...,hk} has asymptotic density given by C(H) ∫_2^x dt/(log t)^k, where the constant C(H) is the singular series defined as an Euler product over primes p reflecting local solubility, a concept reminiscent of Euler products appearing in work of Leonhard Euler and the global–local philosophy employed by André Weil and Jean-Pierre Serre. The singular series vanishes for inadmissible tuples and is positive otherwise; its computation uses multiplicative functions and reciprocity principles traced to Johann Heinrich Lambert and refined in analytic treatments by G. H. Hardy and J. E. Littlewood. The formulation draws a parallel with conjectures connecting prime distributions to zero-free regions for L-functions studied in the lineage of Bernhard Riemann and Atle Selberg.

Evidence, heuristics, and numerical data

Heuristic derivations employ probabilistic models of primes resembling ideas of Harald Cramér and use sieve-theoretic intuition from the work of V. A. Brun and Atle Selberg; extensive numerical verification has been carried out by researchers affiliated with University of Illinois Urbana-Champaign, University of Waterloo, and independent collaborators such as Tomás Oliveira e Silva and teams linked to University of Tennessee. Data for twin primes, prime triplets, and longer constellations agree well with predicted singular series-weighted counts up to very large bounds, paralleling computational confirmations in research by groups at Los Alamos National Laboratory and computational projects centered at Stanford University. Nevertheless, the heuristics do not constitute a proof, and tensions remain with deep conjectures like the Generalized Riemann Hypothesis and speculative models from the Montgomery pair correlation conjecture circle.

Partial results and related theorems

Progress toward k-tuple predictions includes sieve-theoretic bounds from Brun and later refinements by Enrico Bombieri, H. Halberstam, D. A. Goldston, János Pintz, and Christopher Hooley; the Green–Tao theorem on arithmetic progressions demonstrates existence of arbitrarily long prime patterns but does not give the Hardy–Littlewood asymptotics. Breakthroughs such as bounded gaps between primes by Yitang Zhang and subsequent optimizations by the Polymath Project and researchers including James Maynard and Terence Tao reduced maximal gaps yet fall short of establishing full k-tuple asymptotics. Conditional results assuming hypotheses like the Elliott–Halberstam conjecture provide stronger distributional control related to singular series quantities.

Generalizations and variants

Generalizations include conjectures for prime-producing polynomial values inspired by Bunyakovsky's conjecture and extended formulations for prime ideals in number fields paralleling problems studied by Alexander Grothendieck-era algebraic number theorists and Emil Artin; variants consider patterns of primes in sparse sequences related to work by Paul Erdős and Andrew Granville. Analogous singular-series phenomena appear in statistical questions about zeros of L-functions and in correlations studied by Hugh Montgomery and Zeév Rudnick. Ongoing research at institutions such as Institute for Advanced Study and collaborations across Princeton University and École Normale Supérieure continues to explore these extensions.

Category:Conjectures in number theory