TOPICS
Search

k-Tuple Conjecture


The k-tuple conjecture, also called the first of the Hardy-Littlewood conjectures, states that the asymptotic number of prime constellations can be computed explicitly. In particular, unless there is a trivial divisibility condition that stops p, p+a_1, ..., p+a_k from consisting of primes infinitely often, then such prime constellations will occur with an asymptotic density which is computable in terms of a_1, ..., a_k. Let 0<m_1<m_2<...<m_k be integers. For each odd prime number q, let w(q;m_1,...,m_k) be the number of distinct residues of 0, m_1, ..., m_k modulo q. If w(q;m_1,...,m_k)<q for every such q, the k-tuple conjecture predicts that the number of primes p<=x such that p+2m_1, p+2m_2, ..., p+2m_k are all prime is

 pi_(m_1,m_2,...,m_k)(x)∼C(m_1,m_2,...,m_k)int_2^x(dt)/(ln^(k+1)t),
(1)

where

 C(m_1,m_2,...,m_k)=2^kproduct_(q)(1-(w(q;m_1,m_2,...,m_k))/q)/((1-1/q)^(k+1)),
(2)

and the product is over the odd primes q (Halberstam and Richert 1974, Odlyzko et al. 1999). If w(q;m_1,...,m_k)=q for some q, then any prime tuple must contain q, so only finitely many can occur. For k=1 the constant reduces to

 C(m)=2product_(q>2; q prime)(q(q-2))/((q-1)^2)product_(q>2, q|m; q prime)(q-1)/(q-2).
(3)

The conjecture remains open. If it holds, then the second Hardy-Littlewood conjecture fails (Hensley and Richards 1974).

The twin prime conjecture

 pi_1(x)∼2Pi_2int_2^x(dt)/((lnt)^2)
(4)

is the case k=m_1=1. Here pi_1(x) counts twin primes whose smaller prime number is at most x, and Pi_2 is the twin primes constant.

The following special case of the conjecture is sometimes known as the prime patterns conjecture. Let S be a finite set of integers. Then it is conjectured that there exist infinitely many k for which {k+s:s in S} are all prime iff S does not include all the residues of any prime. This conjecture also implies that there are arbitrarily long arithmetic progressions of primes.


See also

Arithmetic Progression, Dirichlet's Theorem, Hardy-Littlewood Conjectures, Prime Arithmetic Progression, Prime Constellation, Prime Quadruplet, Twin Prime Conjecture, Twin Primes, Twin Primes Constant

Explore with Wolfram|Alpha

References

Brent, R. P. "The Distribution of Small Gaps between Successive Primes." Math. Comput. 28, 315-324, 1974.Brent, R. P. "Irregularities in the Distribution of Primes and Twin Primes." Math. Comput. 29, 43-56, 1975.Halberstam, E. and Richert, H.-E. Sieve Methods. New York: Academic Press, 1974.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.Odlyzko, A.; Rubinstein, M.; and Wolf, M. "Jumping Champions." Experiment. Math. 8, 107-118, 1999. https://doi.org/10.1080/10586458.1999.10504393.Riesel, H. Prime Numbers and Computer Methods for Factorization, 2nd ed. Boston, MA: Birkhäuser, pp. 66-68, 1994.

Referenced on Wolfram|Alpha

k-Tuple Conjecture

Cite this as:

Weisstein, Eric W. "k-Tuple Conjecture." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/k-TupleConjecture.html

Subject classifications