Prime ''k''-tuple

In number theory, a prime k-tuple is a finite collection of values representing a repeatable pattern of differences between prime numbers. For a k-tuple (a, b, ...), the positions where the k-tuple matches a pattern in the prime numbers are given by the set of integers n such that all of the values (n + a, n + b, ...) are prime. Typically the first value in the k-tuple is 0 and the rest are distinct positive even numbers.^[1]

Named patterns

Several of the shortest k-tuples are known by other common names:

OEIS sequence  A257124 covers 7-tuples (prime septuplets) and contains an overview of related sequences, e.g. the three sequences corresponding to the three admissible 8-tuples (prime octuplets), and the union of all 8-tuples. The first term in these sequences corresponds to the first prime in the smallest prime constellation shown below.

Admissibility

In order for a k-tuple to have infinitely many positions at which all of its values are prime, there cannot exist a prime p such that the tuple includes every different possible value modulo p. For, if such a prime p existed, then no matter which value of n was chosen, one of the values formed by adding n to the tuple would be divisible by p, so there could only be finitely many prime placements (only those including p itself). For example, the numbers in a k-tuple cannot take on all three values 0, 1, and 2 modulo 3; otherwise the resulting numbers would always include a multiple of 3 and therefore could not all be prime unless one of the numbers is 3 itself. A k-tuple that satisfies this condition (i.e. it does not have a p for which it covers all the different values modulo p) is called admissible.

It is conjectured that every admissible k-tuple matches infinitely many positions in the sequence of prime numbers. However, there is no admissible tuple for which this has been proven except the 1-tuple (0). Nevertheless, by Yitang Zhang's famous proof of 2013 it follows that there exists at least one 2-tuple which matches infinitely many positions.

Prime constellations

The diameter of a k-tuple is the difference of its largest and smallest elements. An admissible prime k-tuple with the smallest possible diameter d (among all admissible k-tuples) is a prime constellation. For all n ≥ k this will always produce consecutive primes.^[2]

This means that, for large n:

p_n+k−1 − p_n ≥ d

where p_n is the nth prime.

The first few prime constellations are:

The diameter d as a function of k is sequence A008407 in OEIS.

A prime constellation is sometimes referred to as a prime k-tuplet, but some authors reserve that term for instances that are not part of longer k-tuplets.

The first Hardy–Littlewood conjecture predicts that the asymptotic frequency of any prime constellation can be calculated. While the conjecture is unproven it is considered likely to be true. If that is the case, it implies that the second Hardy–Littlewood conjecture, in contrast, is false.

Prime arithmetic progressions

A prime k-tuple of the form (0, n, 2n, ...) is said to be a prime arithmetic progression. In order for such a k-tuple to meet the admissibility test, n must be a multiple of the primorial of k.^[4]

References