Loading ...
Sorry, an error occurred while loading the content.

24835Re: mod quartic composite tests

Expand Messages
  • paulunderwooduk
    Jan 21, 2013
    • 0 Attachment
      --- In primenumbers@yahoogroups.com, "paulunderwooduk" wrote:

      >
      > > > >
      > > > > {tst(n,x)=kronecker(x^2-4,n)==-1&&
      > > > > gcd(x+1,n)==1&&
      > > > > Mod(Mod(1,n)*(L+x+1),(L^2-x*L+1)*(L^2+x*L+1))^(n)==-L^3+(x^2-2)*L+x+1;}
      > > > >
      >

      Here is another test, on the same theme, for which I cannot also easily find a fraud:

      {tst(n,x)=kronecker(x^2-4,n)==-1&&
      gcd(x^2-1,n)==1&&
      Mod(Mod(1,n)*(L+x^2-1),(L^2-x*L+1)*(L^2+x*L+1))^(n)==-L^3+(x^2-2)*L+x^2-1;}

      Paul
    • Show all 26 messages in this topic