Little twin prime theorem

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

.

Relevant Pages

  • Re: Little twin prime theorem
    ... Han de Bruijn wrote: ... lot of twin primes ... ... You can find a lot of twin pairs; but you wont know which pairs are ...
    (sci.math)
  • Re: Little twin prime theorem
    ... Han de Bruijn wrote: ... Now devise an algorithm for finding a ... Counterexample - consider the twin primes 3 and 5. ...
    (sci.math)
  • Re: The renascence of mathematics
    ... the existence of infinitely many twin primes results ... because there is an algorithm to obtain the twin primes. ... Ludovicus ...
    (sci.math)
  • Re: The renascence of mathematics
    ... only if there is an algoritm to obtain it from the sequence of natural ... the existence of infinitely many twin primes results ... There is an algorith for producing the primes one to one. ... An algorithm must be finite. ...
    (sci.math)
  • Re: Little twin prime theorem
    ... Now devise an algorithm for finding a ... lot of twin primes ... ... You can find a lot of twin pairs; but you wont know which pairs are ...
    (sci.math)