Quote:
Originally Posted by paulunderwood
Code:
{
tst(n,a)=local(A=a^2+a);
kronecker(A,n)==1&&
kronecker(a,n)==1&&
Mod(A,n)^((n1)/2)==1&&
Mod(a,n)^((n1)/2)==1&&
Mod(Mod(z,n),z^2(4*a/(a1)2)*z+1)^((n+1)/2)==1
}
I am running this test against Richard Pinch's Carmichael number list and with David Broadhurst's CRT Semiprime Pari/GP script.

Given a Carmichael number N or a semiprime p*q, what code do you run against it, exactly? Surely you're not looping over possible a, that would take forever.