UNSOLVED PROBLEMS |

In Number Theory, Logic, and Cryptography |

Twin Primes Conjecture |

The twin primes conjecture states that there are an infinite number of pairs of primes of the form 2n-1, 2n+1. That is, they differ by 2; for example, 41 and 43.
The problem is to prove or disprove the conjecture.
For further information, please see: [1] http://mathworld.wolfram.com/TwinPrimeConjecture.html [2] http://en.wikipedia.org/wiki/Twin_prime_conjecture [3] http://primes.utm.edu/glossary/page.php?sort=TwinPrimeConjecture
You can check for contributions to this problem on the solutions page.
——————————–- This web site developed and maintained by Tim S Roberts Email: timro21@gmail.com |