View Single Post
Old 2021-02-21, 16:17   #18
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

3×5×263 Posts
Default

Latest test:
Code:
{EulerPRP(a,n)=Mod(a,n)^((n-1)/2)==kronecker(a,n);}

{
tst(n,a)=
gcd(a+3,n)==1&&
gcd(3*a+1,n)==1&&
gcd(a^2+6*a+1,n)==1&&
kronecker(a,n)==-1&&
Mod(a,n)^((n-1)/2)==-1&&
EulerPRP(2,n)&&
EulerPRP(3,n)&&
EulerPRP(a-1,n)&&
EulerPRP(a+1,n)&&
Mod(Mod(x,n),x^2-(4*a/(a-1)-2)*x+1)^((n+1)/2)==kronecker(a*(a-1),n);
}
If this fails I will have hit a brick wall.

Last fiddled with by paulunderwood on 2021-02-21 at 16:33
paulunderwood is offline   Reply With Quote