Update dixon.py

Author: daedalus

dixon.py

@@ -1,7 +1,7 @@
 from gmpy2 import isqrt,gcd,next_prime
 import sys
 
-def dixon(N,B=100):
+def dixon(N,B=7):
 
   tmp = []
   pairs = []
@@ -15,23 +15,28 @@ def primes(B):
     return tmp
 
   base = primes(B)
+
+  #print(base)
 
   start = isqrt(N)
   i = start
   while i<=N:
     for j in range(len(base)):
       l = pow(i,2, N)
       r = pow(base[j],2,N)
+      #print(i,j,l,r)
       if l == r:
         pairs.append([i,base[j]])
-        print(pairs)
+        #print(pairs)
     i+=1
 
+  #print(pairs)
+
   for i in range(len(pairs)):
     x = pairs[i][0]
     y = pairs[i][1]
-    tmp.append(gcd(x-y,N))
-
-  return tmp
+    f = (gcd(x-y,N))
+    if 1 < f < N:
+      return f,N//f
 
 print(dixon(int(sys.argv[1])))