Difference between revisions of "Twin primes"
Jump to navigation
Jump to search
m (supercat, markup) |
|||
| Line 1: | Line 1: | ||
| − | '''Twin primes''' are pairs of prime | + | '''Twin primes''' are pairs of [[prime number]]s whose [[difference]] is 2. |
The smallest twin primes are (3, 5), (5, 7), (11, 13), (17, 19), (29, 31), (41, 43). | The smallest twin primes are (3, 5), (5, 7), (11, 13), (17, 19), (29, 31), (41, 43). | ||
| Line 6: | Line 6: | ||
Proving that there are infinitely many twin primes (the [[twin prime conjecture]]) is one of the great unsolved problems in [[mathematics]]. | Proving that there are infinitely many twin primes (the [[twin prime conjecture]]) is one of the great unsolved problems in [[mathematics]]. | ||
| + | |||
| + | ==See also== | ||
| + | *[[Brun's constant]] | ||
== References == | == References == | ||
| Line 15: | Line 18: | ||
*http://numbers.computation.free.fr/Constants/Primes/twin.html | *http://numbers.computation.free.fr/Constants/Primes/twin.html | ||
| − | |||
[[Category:Prime Numbers]] | [[Category:Prime Numbers]] | ||
Revision as of 09:39, November 16, 2008
Twin primes are pairs of prime numbers whose difference is 2.
The smallest twin primes are (3, 5), (5, 7), (11, 13), (17, 19), (29, 31), (41, 43).
All twin primes except (3, 5) are of the form 6n +/- 1.[1]
Proving that there are infinitely many twin primes (the twin prime conjecture) is one of the great unsolved problems in mathematics.