Set of 3 prime numbers whose largest and smallest differ by 6
Innumber theory, a prime triplet is a set of three prime numbers in which the smallest and largest of the three differ by 6. In particular, the sets must have the form (p, p + 2, p + 6)or(p, p + 4, p + 6).[1] With the exceptions of (2, 3, 5) and (3, 5, 7), this is the closest possible grouping of three prime numbers, since one of every three sequential odd numbers is a multiple of three, and hence not prime (except for 3 itself).
A prime can be a member of up to three prime triplets - for example, 103 is a member of (97, 101, 103), (101, 103, 107) and (103, 107, 109). When this happens, the five involved primes form a prime quintuplet.
Aprime quadruplet(p, p + 2, p + 6, p + 8) contains two overlapping prime triplets, (p, p + 2, p + 6) and (p + 2, p + 6, p + 8).
Similarly to the twin prime conjecture, it is conjectured that there are infinitely many prime triplets. The first known gigantic prime triplet was found in 2008 by Norman Luhn and François Morain. The primes are (p, p + 2, p + 6) with p = 2072644824759 × 233333 − 1. As of October 2020[update] the largest known proven prime triplet contains primes with 20008 digits, namely the primes (p, p + 2, p + 6) with p = 4111286921397 × 266420 − 1.[2]
The Skewes number for the triplet (p, p + 2, p + 6) is 87613571, and for the triplet (p, p + 4, p + 6) it is 337867.[3]
