Big primes by Carlos Gutierrez

for(p=32416187567;n<100;p++){b=2
c=!scale=0
for(e=p;e;e/=2){if(e%2)c=c*b%p
b=b*b%p}
if(c==2)p+!++n}

Note that non-ascii characters in the above source code will be escaped (such as \x9f).

download

return to the top page