Big primes by teebee(Carlos Gutierrez)

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

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

download

return to the top page