PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: Very high
twin prime conjecture (Conjecture)

Two consecutive odd numbers which are both prime are called twin primes, e.g. 5 and 7, or 41 and 43, or 1,000,000,000,061 and 1,000,000,000,063. But is there an infinite number of twin primes ?

In 1849 de Polignac made the more general conjecture that for every natural number $ n$, there are infinitely many prime pairs which have a distance of $ 2n$. The case $ n=1$ is the twin prime conjecture.

In 1940, Erdős showed that there is a constant $ c<1$ and infinitely many primes $ p$ such that $ q-p<c \ln{p}$ where $ q$ denotes the next prime after $ p$. This result was improved in 1986 by Maier; he showed that a constant $ c < 0.25$ can be used. The constant $ c$ is called the twin prime constant.

In 1966, Chen Jingrun showed that there are infinitely many primes $ p$ such that $ p+2$ is either a prime or a semiprime.



"twin prime conjecture" is owned by alozano. [ full author list (2) | owner history (1) ]
(view preamble | get metadata)

View style:

See Also: prime triples conjecture, Brun's constant

Also defines:  twin prime constant, twin primes
Log in to rate this entry.
(view current ratings)

Cross-references: semiprime, Chen Jingrun, distance, natural number, conjecture, number, infinite, prime, odd numbers, consecutive
There are 16 references to this entry.

This is version 8 of twin prime conjecture, born on 2003-01-07, modified 2006-10-04.
Object id is 3883, canonical name is TwinPrimesTheNumberOfConjuncture.
Accessed 5351 times total.

Classification:
AMS MSC11N05 (Number theory :: Multiplicative number theory :: Distribution of primes)

Pending Errata and Addenda
None.
[ View all 7 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | prove | add result | add corollary | add example | add (any)