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:

(0, 2)	twin primes
(0, 4)	cousin primes
(0, 6)	sexy primes
(0, 2, 6), (0, 4, 6)	prime triplets
(0, 6, 12)	sexy prime triplets
(0, 2, 6, 8)	prime quadruplets, prime decade
(0, 6, 12, 18)	sexy prime quadruplets
(0, 2, 6, 8, 12), (0, 4, 6, 10, 12)	quintuplet primes
(0, 4, 6, 10, 12, 16)	sextuplet primes

OEIS sequence OEIS: 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; subsequent work showed that some 2-tuple exists with values differing by 246 or less that matches infinitely many positions.[2]

Positions matched by inadmissible patterns

Although (0, 2, 4) is not admissible it does produce the single set of primes, (3, 5, 7).

Some inadmissible k-tuples have more than one all-prime solution. This cannot happen for a k-tuple that includes all values modulo 3, so to have this property a k-tuple must cover all values modulo a larger prime, implying that there are at least five numbers in the tuple. The shortest inadmissible tuple with more than one solution is the 5-tuple (0, 2, 8, 14, 26), which has two solutions: (3, 5, 11, 17, 29) and (5, 7, 13, 19, 31) where all congruences (mod 5) are included in both cases.

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.[3] (Remember that all n are integers for which the values (n + a, n + b, ...) are prime.)

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:

k	d	Constellation	smallest[4]
2	2	(0, 2)	(3, 5)
3	6	(0, 2, 6) (0, 4, 6)	(5, 7, 11) (7, 11, 13)
4	8	(0, 2, 6, 8)	(5, 7, 11, 13)
5	12	(0, 2, 6, 8, 12) (0, 4, 6, 10, 12)	(5, 7, 11, 13, 17) (7, 11, 13, 17, 19)
6	16	(0, 4, 6, 10, 12, 16)	(7, 11, 13, 17, 19, 23)
7	20	(0, 2, 6, 8, 12, 18, 20) (0, 2, 8, 12, 14, 18, 20)	(11, 13, 17, 19, 23, 29, 31) (5639, 5641, 5647, 5651, 5653, 5657, 5659)
8	26	(0, 2, 6, 8, 12, 18, 20, 26) (0, 2, 6, 12, 14, 20, 24, 26) (0, 6, 8, 14, 18, 20, 24, 26)	(11, 13, 17, 19, 23, 29, 31, 37) (17, 19, 23, 29, 31, 37, 41, 43) (88793, 88799, 88801, 88807, 88811, 88813, 88817, 88819)
9	30	(0, 2, 6, 8, 12, 18, 20, 26, 30) (0, 4, 6, 10, 16, 18, 24, 28, 30) (0, 2, 6, 12, 14, 20, 24, 26, 30) (0, 4, 10, 12, 18, 22, 24, 28, 30)	(11, 13, 17, 19, 23, 29, 31, 37, 41) (13, 17, 19, 23, 29, 31, 37, 41, 43) (17, 19, 23, 29, 31, 37, 41, 43, 47) (88789, 88793, 88799, 88801, 88807, 88811, 88813, 88817, 88819)

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, 3n, ..., (k−1)n) 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.[5]

Skewes numbers

The Skewes numbers for prime k-tuples are an extension of the definition of Skewes' number to prime k-tuples based on the first Hardy-Littlewood conjecture (Tóth (2019)). Let $P=(p,p+i_{1},p+i_{2},...,p+i_{k})$ denote a prime k-tuple, $\pi _{P}(x)$ the number of primes $p$ below $x$ such that $p,p+i_{1},p+i_{2},...,p+i_{k}$ are all prime, let $\operatorname {li_{P}} (x)=\int _{2}^{x}{\frac {dt}{(\ln t)^{k+1}}}$ and let $C_{P}$ denote its Hardy-Littlewood constant (see first Hardy-Littlewood conjecture). Then the first prime $p$ that violates the Hardy-Littlewood inequality for the k-tuple $P$ , i.e., such that

\pi _{P}(p)>C_{P}\operatorname {li} _{P}(p),

(if such a prime exists) is the Skewes number for $P$ .

The table below shows the currently known Skewes numbers for prime k-tuples:

Prime k-tuple	Skewes number	Found by
(p, p+2)	1369391	Wolf (2011)
(p, p+4)	5206837	Tóth (2019)
(p, p+2, p+6)	87613571	Tóth (2019)
(p, p+4, p+6)	337867	Tóth (2019)
(p, p+2, p+6, p+8)	1172531	Tóth (2019)
(p, p+4, p+6, p+10)	827929093	Tóth (2019)
(p, p+2, p+6, p+8, p+12)	21432401	Tóth (2019)
(p, p+4, p+6, p+10, p+12)	216646267	Tóth (2019)
(p, p+4, p+6, p+10, p+12, p+16)	251331775687	Tóth (2019)

The Skewes number (if it exists) for sexy primes $(p,\ p+6)$ is still unknown.

References

Chris Caldwell, "The Prime Glossary: k-tuple" at The Prime Pages.
"Bounded gaps between primes". PolyMath. Retrieved 2019-04-22.
Weisstein, Eric W. "Prime Constellation". MathWorld.
Tony Forbes, "Smallest Prime k-tuplets".
Weisstein, Eric W. "Prime Arithmetic Progression". MathWorld.

Tóth, László (2019), "On The Asymptotic Density Of Prime k-tuples and a Conjecture of Hardy and Littlewood" (PDF), Computational Methods in Science and Technology, 25 (3), arXiv:1910.02636, doi:10.12921/cmst.2019.0000033, S2CID 203836016.
Wolf, Marek (2011), "The Skewes number for twin primes: counting sign changes of π2(x) − C2Li2(x)" (PDF), Computational Methods in Science and Technology, 17, doi:10.12921/cmst.2011.17.01.87-92, S2CID 59578795.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

[1] Chris Caldwell, "The Prime Glossary: k-tuple" at The Prime Pages.

[2] "Bounded gaps between primes". PolyMath. Retrieved 2019-04-22.

[3] Weisstein, Eric W. "Prime Constellation". MathWorld.

[4] Tony Forbes, "Smallest Prime k-tuplets".

[5] Weisstein, Eric W. "Prime Arithmetic Progression". MathWorld.

Prime number classes
By formula	Fermat ( $2 2 n + 1$ ) Mersenne ( $2 p - 1$ ) Double Mersenne ( $2 2 p -1 - 1$ ) Wagstaff $(2 p + 1)/3$ Proth ( $k \cdot2 n + 1$ ) Factorial ( $n! \pm 1$ ) Primorial ( $p n # \pm 1$ ) Euclid ( $p n # + 1$ ) Pythagorean ( $4 n + 1$ ) Pierpont ( $2 m \cdot3 n + 1$ ) Quartan ( $x 4 + y 4$ ) Solinas ( $2 m \pm 2 n \pm 1$ ) Cullen ( $n \cdot2 n + 1$ ) Woodall ( $n \cdot2 n - 1$ ) Cuban ( $x 3 - y 3)/(x - y$ ) Carol $(2 n - 1) 2 - 2$ Kynea $(2 n + 1) 2 - 2$ Leyland ( $x y + y x$ ) Thabit ( $3\cdot2 n - 1$ ) Williams ( $(b -1)\cdot b n - 1$ ) Mills ( $⌊ A 3 n ⌋$ )
By integer sequence	Fibonacci Lucas Pell Newman–Shanks–Williams Perrin Partitions Bell Motzkin
By property	Wieferich (pair) Wall–Sun–Sun Wolstenholme Wilson Lucky Fortunate Ramanujan Pillai Regular Strong Stern Supersingular (elliptic curve) Supersingular (moonshine theory) Good Super Higgs Highly cototient
Base-dependent	Palindromic Emirp Repunit $(10 n - 1)/9$ Permutable Circular Truncatable Minimal Weakly Primeval Full reptend Unique Happy Self Smarandache–Wellin Strobogrammatic Dihedral Tetradic
Patterns	Twin ( $p, p + 2$ ) Bi-twin chain ( $n - 1, n + 1, 2 n - 1, 2 n + 1, \dots$ ) Triplet ( $p, p + 2 or p + 4, p + 6$ ) Quadruplet ( $p, p + 2, p + 6, p + 8$ ) k−Tuple Cousin ( $p, p + 4$ ) Sexy ( $p, p + 6$ ) Chen Sophie Germain/Safe ( $p, 2 p + 1$ ) Cunningham ( $p, 2 p \pm 1, 4 p \pm 3, 8 p \pm 7, ...$ ) Arithmetic progression ( $p + a\cdotn, n = 0, 1, 2, 3, ...$ ) Balanced ( $consecutive p - n, p, p + n$ )
By size	Titanic (1,000+ digits) Gigantic (10,000+ digits) Mega (1,000,000+ digits) Largest known
Complex numbers	Eisenstein prime Gaussian prime
Composite numbers	Pseudoprime Catalan Elliptic Euler Euler–Jacobi Fermat Frobenius Lucas Somer–Lucas Strong Carmichael number Almost prime Semiprime Interprime Pernicious
Related topics	Probable prime Industrial-grade prime Illegal prime Formula for primes Prime gap
First 60 primes	2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281
List of prime numbers