some enhancements

Author: daedalus

dixon.py

@@ -15,19 +15,19 @@ def primes(B):
   start = isqrt(N)
   i = start
 
-  ii2N = []
+  i2N = []
   while i<=N:
-    ii2N.append((i,pow(i,2,N)))
+    i2N.append(pow(i,2,N))
     i+=1
 
   basej2N = []
   for j in range(0,len(base)):
     basej2N.append(pow(base[j],2,N))
 
-  for i,i2N in ii2N:
+  for i in range(0,len(i2N)):
     for k in range(0,len(base)):
-      if i2N == basej2N[k]:
-        f=gcd(i-base[k],N)
+      if i2N[i] == basej2N[k]:
+        f=gcd(start + i - base[k],N)
         if 1 < f < N:
           return f,N//f
   return -1