Difference between revisions of "Prime triplet"
m (Prime Triplet moved to Prime triplet: correct capitalization) |
(wikify) |
||
| Line 1: | Line 1: | ||
| − | |||
| − | + | A set of three [[prime number]]s which form an arithmetic sequence with common difference two is called a '''prime triplet'''. | |
| − | + | ==Discussion== | |
| + | An example of a prime triplet is <math>\{3,5,7\}</math>. | ||
| − | 3,5,7 turns out to be the only prime triplet. This is because any set {n,n+2,n+4} | + | <math>\{3,5,7\}</math> turns out to be the only prime triplet. This is because any set <math>\{n,n+2,n+4\} \pmod 3</math> becomes <math>\{0,2,1\}</math>, <math>\{2,1,0\}</math>, or <math>\{1,0,2\}</math>. Therefore in every triplet there exists one number that is divisible by <math>3</math>. The only prime number divisible by <math>3</math> is <math>3</math> itself, so the only triplets possible are <math>\{1,3,5\}</math> and <math>\{3,5,7\}</math>. Since 1 is not a prime, <math>\{3,5,7\}</math> is the only prime triplet. |
| + | |||
| + | ==See Also== | ||
| + | *[[Twin Prime Conjecture]] | ||
| + | |||
| + | [[Category:Number theory]] | ||
| + | [[Category:Definition]] | ||
Revision as of 23:02, 20 December 2008
A set of three prime numbers which form an arithmetic sequence with common difference two is called a prime triplet.
Discussion
An example of a prime triplet is 
.
turns out to be the only prime triplet. This is because any set 
becomes 
, 
, or 
. Therefore in every triplet there exists one number that is divisible by 
. The only prime number divisible by is itself, so the only triplets possible are 
and . Since 1 is not a prime, is the only prime triplet.
