Cousin prime

In number theory, cousin primes are prime numbers that differ by four.^[1] Compare this with twin primes, pairs of prime numbers that differ by two, and sexy primes, pairs of prime numbers that differ by six.

The cousin primes (sequences OEIS: A023200 and OEIS: A046132 in OEIS) below 1000 are:

(3, 7), (7, 11), (13, 17), (19, 23), (37, 41), (43, 47), (67, 71), (79, 83), (97, 101), (103, 107), (109, 113), (127, 131), (163, 167), (193, 197), (223, 227), (229, 233), (277, 281), (307, 311), (313, 317), (349, 353), (379, 383), (397, 401), (439, 443), (457, 461), (463,467), (487, 491), (499, 503), (613, 617), (643, 647), (673, 677), (739, 743), (757, 761), (769, 773), (823, 827), (853, 857), (859, 863), (877, 881), (883, 887), (907, 911), (937, 941), (967, 971)

Properties[edit]

The only prime belonging to two pairs of cousin primes is 7. One of the numbers $n, n + 4, n + 8$ will always be divisible by 3, so $n = 3$ is the only case where all three are primes.

An example of a large proven cousin prime pair is $(p, p + 4)$ for

p=4111286921397\times 2^{66420}+1

which has 20008 digits. In fact, this is part of a prime triple since $p$ is also a twin prime (because $p - 2$ is also a proven prime).

As of April 2022^[update], the largest-known pair of cousin primes was found by S. Batalov and has 51,934 digits. The primes are:

p=29055814795\times (2^{172486}-2^{86243})+2^{86245}-3

p+4=29055814795\times (2^{172486}-2^{86243})+2^{86245}+1

^[2]

If the first Hardy–Littlewood conjecture holds, then cousin primes have the same asymptotic density as twin primes. An analogue of Brun's constant for twin primes can be defined for cousin primes, called Brun's constant for cousin primes, with the initial term (3, 7) omitted, by the convergent sum:^[3]

B_{4}=\left({\frac {1}{7}}+{\frac {1}{11}}\right)+\left({\frac {1}{13}}+{\frac {1}{17}}\right)+\left({\frac {1}{19}}+{\frac {1}{23}}\right)+\cdots .

Using cousin primes up to 2⁴², the value of $B 4$ was estimated by Marek Wolf in 1996 as

B_{4}\approx 1.1970449

^[4]

This constant should not be confused with Brun's constant for prime quadruplets, which is also denoted $B 4$ .

The Skewes number for cousin primes is 5206837 (Tóth (2019)).

Notes[edit]

^ Weisstein, Eric W. "Cousin Primes". MathWorld.
^ Batalov, S. "Let's find some large sexy prime pair[s]". mersenneforum.org. Retrieved 2022-09-17.
^ Segal, B. (1930). "Generalisation du théorème de Brun". C. R. Acad. Sci. URSS (in Russian). 1930: 501–507. JFM 57.1363.06.
^ Marek Wolf (1996), On the Twin and Cousin Primes.

References[edit]

Wells, David (2011). Prime Numbers: The Most Mysterious Figures in Math. John Wiley & Sons. p. 33. ISBN 978-1118045718.
Fine, Benjamin; Rosenberger, Gerhard (2007). Number theory: an introduction via the distribution of primes. Birkhäuser. pp. 206. ISBN 978-0817644727.
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.
Wolf, Marek (February 1998). "Random walk on the prime numbers". Physica A: Statistical Mechanics and Its Applications. 250 (1–4): 335–344. Bibcode:1998PhyA..250..335W. doi:10.1016/s0378-4371(97)00661-4.

[1] Weisstein, Eric W. "Cousin Primes". MathWorld.

[2] Batalov, S. "Let's find some large sexy prime pair[s]". mersenneforum.org. Retrieved 2022-09-17.

[3] Segal, B. (1930). "Generalisation du théorème de Brun". C. R. Acad. Sci. URSS (in Russian). 1930: 501–507. JFM 57.1363.06.

[4] Marek Wolf (1996), On the Twin and Cousin Primes.

[1]

[2]

[3]

[4]

v t e 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$ ) 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
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 Unique
Base-dependent	Palindromic Emirp Repunit $(10 n - 1)/9$ Permutable Circular Truncatable Minimal Delicate Primeval Full reptend Unique Happy Self Smarandache–Wellin Strobogrammatic Dihedral Tetradic
Patterns	Twin ( $p, p + 2$ ) Bi-twin chain ( $n \pm 1, 2 n \pm 1, 4 n \pm 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	Mega (1,000,000+ digits) Largest known list
Complex numbers	Eisenstein prime Gaussian prime
Composite numbers	Pseudoprime Catalan Elliptic Euler Euler–Jacobi Fermat Frobenius Lucas Perrin Somer–Lucas Strong Carmichael number Almost prime Semiprime Sphenic number 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