View Single Post
Old 2021-02-18, 13:51   #14
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

135338 Posts
Default

Quote:
Originally Posted by paulunderwood View Post
Code:
{
tst(n,a)=local(A=a^2+a);
kronecker(A,n)==-1&&
kronecker(a,n)==-1&&
Mod(A,n)^((n-1)/2)==-1&&
Mod(a,n)^((n-1)/2)==-1&&
Mod(Mod(z,n),z^2-(4*a/(a-1)-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 Semi-prime 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.
CRGreathouse is offline   Reply With Quote