Jump to content
 







Main menu
   


Navigation  



Main page
Contents
Current events
Random article
About Wikipedia
Contact us
Donate
 




Contribute  



Help
Learn to edit
Community portal
Recent changes
Upload file
 








Search  

































Create account

Log in
 









Create account
 Log in
 




Pages for logged out editors learn more  



Contributions
Talk
 



















Contents

   



(Top)
 


1 Properties  





2 Notes  





3 References  














Cousin prime






Deutsch
Español
Esperanto
Français

Italiano

Suomi
Svenska
Türkçe
Tiếng Vit

 

Edit links
 









Article
Talk
 

















Read
Edit
View history
 








Tools
   


Actions  



Read
Edit
View history
 




General  



What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Wikidata item
 




Print/export  



Download as PDF
Printable version
 
















Appearance
   

 






From Wikipedia, the free encyclopedia
 


Innumber 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 OEISA023200 and OEISA046132inOEIS) 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

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, the largest-known pair of cousin primes was found by S. Batalov and has 51,934 digits. The primes are:

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

Using cousin primes up to 242, the value of B4 was estimated by Marek Wolf in 1996 as

[4]

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

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

Notes

[edit]
  1. ^ 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]
    Retrieved from "https://en.wikipedia.org/w/index.php?title=Cousin_prime&oldid=1231241613"

    Categories: 
    Classes of prime numbers
    Unsolved problems in mathematics
    Hidden categories: 
    CS1 Russian-language sources (ru)
    Articles with short description
    Short description is different from Wikidata
    Articles containing potentially dated statements from April 2022
    All articles containing potentially dated statements
     



    This page was last edited on 27 June 2024, at 07:37 (UTC).

    Text is available under the Creative Commons Attribution-ShareAlike License 4.0; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.



    Privacy policy

    About Wikipedia

    Disclaimers

    Contact Wikipedia

    Code of Conduct

    Developers

    Statistics

    Cookie statement

    Mobile view



    Wikimedia Foundation
    Powered by MediaWiki