Quote:
Originally Posted by science_man_88
Paridroid gave 4.66 and 28.66 seconds with a halfass script:
Code:
try(p)=my(x=Mod(4,2^p-1));for(y=3,p,sqr(x)-2);x==0
|
We can easily make SM's code quicker with RG's code posted elsewhere which does the mod reduction efficiently.