Cousin prime

Last updated November 03, 2023

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.

(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

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

↑ 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.

Related Research Articles

In mathematics, the Bernoulli numbers $B n$ are a sequence of rational numbers which occur frequently in analysis. The Bernoulli numbers appear in the Taylor series expansions of the tangent and hyperbolic tangent functions, in Faulhaber's formula for the sum of m-th powers of the first n positive integers, in the Euler–Maclaurin formula, and in expressions for certain values of the Riemann zeta function.

<span class="mw-page-title-main">Carmichael number</span> Composite number in number theory

In number theory, a Carmichael number is a composite number $, which in modular arithmetic satisfies the congruence relation:$

A twin prime is a prime number that is either 2 less or 2 more than another prime number—for example, either member of the twin prime pair or $(41, 43)$ . In other words, a twin prime is a prime that has a prime gap of two. Sometimes the term twin prime is used for a pair of twin primes; an alternative name for this is prime twin or prime pair.

Goldbach's conjecture is one of the oldest and best-known unsolved problems in number theory and all of mathematics. It states that every even natural number greater than 2 is the sum of two prime numbers.

2 (two) is a number, numeral and digit. It is the natural number following 1 and preceding 3. It is the smallest and only even prime number. Because it forms the basis of a duality, it has religious and spiritual significance in many cultures.

The Ulam spiral or prime spiral is a graphical depiction of the set of prime numbers, devised by mathematician Stanisław Ulam in 1963 and popularized in Martin Gardner's Mathematical Games column in Scientific American a short time later. It is constructed by writing the positive integers in a square spiral and specially marking the prime numbers.

In number theory, Skewes's number is any of several large numbers used by the South African mathematician Stanley Skewes as upper bounds for the smallest natural number $for which$

In number theory, Cramér's conjecture, formulated by the Swedish mathematician Harald Cramér in 1936, is an estimate for the size of gaps between consecutive prime numbers: intuitively, that gaps between consecutive primes are always small, and the conjecture quantifies asymptotically just how small they must be. It states that

In number theory, sexy primes are prime numbers that differ from each other by 6. For example, the numbers 5 and 11 are both sexy primes, because both are prime and 11 − 5 = 6.

In number theory, an Euler product is an expansion of a Dirichlet series into an infinite product indexed by prime numbers. The original such product was given for the sum of all positive integers raised to a certain power as proven by Leonhard Euler. This series and its continuation to the entire complex plane would later become known as the Riemann zeta function.

In number theory, a formula for primes is a formula generating the prime numbers, exactly and without exception. No such formula which is efficiently computable is known. A number of constraints are known, showing what such a "formula" can and cannot be.

In mathematics and the field of number theory, the Landau–Ramanujan constant is the positive real number b that occurs in a theorem proved by Edmund Landau in 1908, stating that for large $, the number of positive integers below that are the sum of two square numbers behaves asymptotically as$

In number theory, a prime quadruplet is a set of four prime numbers of the form ${p, p + 2, p + 6, p + 8}.$ This represents the closest possible grouping of four primes larger than 3, and is the only prime constellation of length 4.

In number theory, the Bateman–Horn conjecture is a statement concerning the frequency of prime numbers among the values of a system of polynomials, named after mathematicians Paul T. Bateman and Roger A. Horn who proposed it in 1962. It provides a vast generalization of such conjectures as the Hardy and Littlewood conjecture on the density of twin primes or their conjecture on primes of the form n² + 1; it is also a strengthening of Schinzel's hypothesis H.

In number theory, Mills' constant is defined as the smallest positive real number A such that the floor function of the double exponential function

<span class="mw-page-title-main">Brun's theorem</span> Theorem that the sum of the reciprocals of the twin primes converges

In number theory, Brun's theorem states that the sum of the reciprocals of the twin primes converges to a finite value known as Brun's constant, usually denoted by B₂. Brun's theorem was proved by Viggo Brun in 1919, and it has historical importance in the introduction of sieve methods.

In number theory, Polignac's conjecture was made by Alphonse de Polignac in 1849 and states:

In number 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)$ . 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).

Goldbach's comet is the name given to a plot of the function $, the so-called Goldbach function . The function, studied in relation to Goldbach's conjecture, is defined for all even integers to be the number of different ways in which E can be expressed as the sum of two primes. For example, since 22 can be expressed as the sum of two primes in three different ways.$

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, \dots)$ , 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, \dots)$ are prime. Typically the first value in the $k$ -tuple is 0 and the rest are distinct positive even numbers.

References

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.

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[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 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 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 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

Cousin prime

Contents

Properties

Notes

Related Research Articles

References