Quote:
Originally Posted by paulunderwood
You could have done n%100==63 instead.
Anyway thanks.
With the counterexample [62611454518799, 9] I need to go back to the drawing board.
I had a PM for Dr. Sardonicus, wherein he describes a method to generate counterexamples for a=4. Perhaps he will post his method here.

Thank you also to have drive me into this question of this exceptions. And also to put me on the language PARI, usually I program on MMA.
At the beginning I wanted to translate your code into MMA to better measure it, but I couldn't translate the "kronecker" function
(if someone knows how to translate the "kronecker" function into MMA?).
so I downloaded PARI 2.13, and i made my first code PARI.
Occasionally, I wanted to make a calculation status in your code, to know where "n" is in the calculation, but I didn't succeed:
Code:
{
forstep(a=3,3,1,print(a);D=a^24;E=D^24;s=187655186463;
forstep(n=177655186463,1840473667452,4*E,
if(n>=s,s=s+10000000000;print([n,s]),
if((nfloor(n%)*100)==63,
if(kronecker(D,n)==1&&!ispseudoprime(n),
r=Mod(D,n)^((n1)/2);s=Mod(E,n)^((n1)/2);
if(r==1&&s==1,print([n,r,s])))))))
}
I don't know why its plant?