- Apr 1, 2012Hi,

I have formulated another composite test variant:

Non-square N>5, with gcd(30,N)==1, is prime if and only if for any integer x:

gcd(x^3-x,N)==1 and

jacobiSymbol(D,N)==-1 and

jacobiSymbol(x+2,N)==-1

then

x^(N-1)==1 (mod N) (Fermat) and

(L^2-1)^(N+1)==-D (mod N, L^2-x*L+1)

where D=x^2-4.

I have a long list of such conjectures, all of which will be tested to some high level, once my other projects are cleared,

Paul - << Previous post in topic Next post in topic >>