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

24754Re: single frobenius and double fermat

Expand Messages
  • djbroadhurst
    Dec 11, 2012
    • 0 Attachment
      --- In primenumbers@yahoogroups.com,
      "paulunderwooduk" <paulunderwood@...> wrote:

      > Here yet another new composite test.
      > This time there is a sneaky use of 2

      But still easy to fool:

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

      {if(tst(37423804289,10332300710),print(fooled));}

      fooled

      David
    • Show all 24 messages in this topic