Well that was a lot of BS maths.
Quote:
Originally Posted by paulunderwood
Let:
x^2P*x+Q=0
y^2P*yQ=0
s^2P*s+R=0
t^2P*tR=0

I have tested (with strong kroneckers and gcd(P,n)==1 and gcd(Q^2R^2,n)==1) for Q=1 up to n < 10^6 and for all Q for n up to 1.8*10^4 with Pari/GP. When I get some free time I will convert to my own C library