Quote:
Originally Posted by Ale
this is 7
3 x 3 x 2 x 4 x 3 x 2 x 3 x 4 x 5 x 3 x 2 x 4 x 3 x 4 x 5 x 6 x 3 x 4 x 5 x 3 x 4 x 5 x 6 x 3 x 5 x 6 x 7 = 3047495270400000 1 = 3047495270399999
now 8 is:
3 x 3 x 2 x 4 x 3 x 2 x 3 x 4 x 5 x 3 x 2 x 4 x 3 x 4 x 5 x 6 x 3 x 4 x 5 x 3 x 4 x 5 x 6 x 3 x 5 x 6 x 7 x3 x 2 x 4 x 5 x 6 x 3 x 4 x 5 x 6 x 3 x ? 6 x 7 x 8 = n  1 = prime number
or
x ? 5 x 6 x 7 x 8 = n  1 = prime number
I can not test the true mechanism , but i think ( you see 4 x 5 x 6 , 3 times , and the number moltiplication 3 always after a series of numbers ) , i think that ,in this mechanism there is peralps hide one algorithm particular for to find a prime numbers.

I see 4*5*6 4 times. I'm still missing something or I don't see why this should always produce primes in fact I can telll you for ? not more than 8 the first multiplication you suggest never gives a prime:
Code:
(13:37) gp > %32*2 * 4 * 5 * 6 * 3 * 4 * 5 * 6 * 3 * 6 * 7 * 8
%39 = 265410020093460480000000
(14:03) gp > for(x=1,8,print(isprime(x*%391)))
0
0
0
0
0
0
0
0