Re: Little twin prime theorem
- From: "bill" <b92057@xxxxxxxxx>
- Date: 31 May 2006 12:22:51 -0700
Han de Bruijn wrote:
Between any two twin primes there is a number which is always divisible
by six. Proof: (p1*n*p2)/(1*2*3) is a number of combinations, therefore
an integer [= n!/((n-k)!k!) for k = 3]. Since the twin primes p1 and p2
are only divisible by themselves and 1, the number n in between must be
divisible by 1*2*3 = 6. Nice huh? Now devise an algorithm for finding a
lot of twin primes ...
Han de Bruijn
Wont work! Not all N = 6*n -1 and 6*n +1 are primes. Ex: 185 &187.
You can find a lot of twin pairs; but you wont know which pairs are
actualy TP's
Bill
.
- References:
- Little twin prime theorem
- From: Han de Bruijn
- Little twin prime theorem
- Prev by Date: Re: Mechanical Engineering at University
- Next by Date: Re: Mechanical Engineering at University
- Previous by thread: Re: Little twin prime theorem
- Next by thread: question on algebra equation
- Index(es):
Relevant Pages
|
|
