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

25206Re: Fermat+Euler+Frobenius

Expand Messages
  • djbroadhurst
    Jul 15, 2013
    • 0 Attachment
      --- In primenumbers@yahoogroups.com, "paulunderwooduk" <paulunderwood@...> wrote:

      > In pari-speak:
      > {tst(n,a)=kronecker(a^2-1,n)==-1&&
      > gcd(a,n)==1&&
      > Mod(a^2-1,n)^((n-1)/2)==-1&&
      > Mod(a^2-9,n)^(n-1)==1&&
      > Mod(Mod(1,n)*(L+a),L^2-2*a*L+1)^(n+1)==3*a^2+1;}

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

      {n=18716367291828127605803202146374280131174122610218950329243\
      75370060752249858742800088185928944839179221397424300401208101;

      a=46354990728672473357718750501279519419666866604904480070651\
      7441641353515300610340484778232167914470462548902372399325637;

      if(tst(n,a)&&!isprime(n),print(" Gremlins are happy"));}

      Gremlins are happy

      David (their minder)
    • Show all 24 messages in this topic