TOPICS
Search

Hardy-Littlewood Conjectures


The Hardy-Littlewood conjectures are two conjectures about the distribution of primes. The first is called the k-tuple conjecture. It states that the asymptotic number of prime constellations can be computed explicitly. A particular case gives the so-called strong twin prime conjecture.

For a fixed positive even number h, write pi_h(x) for the number of primes p<=x for which p+h is also a prime number. Lee (2026) proved the conditional asymptotic

 pi_h(x)∼2Pi_2(product_(p>2, p|h)(p-1)/(p-2))x/((lnx)^2),

where Pi_2 is the twin primes constant and the product is over primes dividing h. The assumption is a uniform two-over-two ratios formula for the Riemann zeta function with real parts of the four shifts in [3/64,5/64] and imaginary parts bounded in absolute value by U^nu at height U, for fixed 0<nu<=1/4. The required error is O_epsilon(U^(theta+epsilon)) for every epsilon>0 for some fixed 1/2<=theta<(39-sqrt(177))/32.

The second Hardy-Littlewood conjecture states that

 pi(x+y)-pi(x)<=pi(y)

for all integers x,y>=2, where pi(x) is the prime counting function.

PrimePiDifferences

The following table summarizes the first few values of pi(x+y)-pi(x) for integer y and x=1, 2, .... The values of this function are plotted above.

yOEISpi(x+y)-pi(x) for x=1, 2, ...
1A0100511, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, ...
2A0904052, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, ...
3A0904062, 2, 1, 2, 1, 1, 0, 1, 1, 2, 1, 1, 0, 1, 1, 2, 1, 1, 0, ...

The two conjectures are incompatible (Hensley and Richards 1974, Richards 1974).


See also

Bouniakowsky Conjecture, Prime Constellation, Prime Counting Function, Second Hardy-Littlewood Conjecture, Twin Prime Conjecture

Explore with Wolfram|Alpha

References

Guy, R. K. §A9 in Unsolved Problems in Number Theory, 3rd ed. New York: Springer-Verlag, 2004.Hardy, G. H. and Littlewood, J. E. "Some Problems of 'Partitio Numerorum.' III. On the Expression of a Number as a Sum of Primes." Acta Math. 44, 1-70, 1923.Hensley, D. and Richards, I. "Primes in Intervals." Acta Arith. 25, 375-391, 1974. https://doi.org/10.4064/aa-25-4-375-391.Lee, S. "The Hardy-Littlewood Asymptotic for Prime Pairs of Fixed Even Difference from a Uniform Zeta-Ratios Conjecture." 3 Nov 2026. https://arxiv.org/abs/2610.32672v2.Richards, I. "On the Incompatibility of Two Conjectures Concerning Primes; A Discussion of the Use of Computers in Attacking a Theoretical Problem." Bull. Amer. Math. Soc. 80, 419-438, 1974.Riesel, H. Prime Numbers and Computer Methods for Factorization, 2nd ed. Boston, MA: Birkhäuser, pp. 61-62 and 68-69, 1994.Sloane, N. J. A. Sequences A010051, A090405, and A090406 in "The On-Line Encyclopedia of Integer Sequences."

Referenced on Wolfram|Alpha

Hardy-Littlewood Conjectures

Cite this as:

Weisstein, Eric W. "Hardy-Littlewood Conjectures." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Hardy-LittlewoodConjectures.html

Subject classifications