Lucas Probable Prime test

lucas.py

@@ -162,34 +162,32 @@ def LucasFast(k, p, q, n):
         tp = tp // 2
     return(uc, vc)
 
-
-for i in range(1, 20, 2):
-    if hasIntSQRT(i):
-        continue
-    d = FirstD(i)
+def LucasPrime(n):
+    """Lucas probable prime test
+    (note: not the "strong" test.)
+    """
+    if n < 2:
+        return False
+    if n == 2:
+        return True
+    if n % 2 == 0:
+        return False
+    d = FirstD(n)
+    if d == 0:
+        return False
     q = (1 - d) // 4
-    fu, fv = LucasFast(i + 1, 1, q, i)
-    su, sv = Lucas(i + 1, 1, q)
-    su = su % i
-    sv = sv % i
-    if (fu != su) or (fv != sv):
-        print("{}: {}, {}; {} {}".format(i, fu, fv, su, sv))
-print("Done!")
-
-i = 19999999999999999999999999999999999999999999999999999999999
-t1 = process_time()
-hasIntSQRT(i)
-te = process_time() - t1
-print(te)
-t1 = process_time()
-d = FirstD(i)
-te = process_time() - t1
-print(te)
-q = (1 - d) // 4
-t1 = process_time()
-LucasFast(i + 1, 1, q, i)
-te = process_time() - t1
-print(te)
-t1 = process_time()
+    lnum = LucasFast(n + 1, 1, q, n)
+    return lnum[0] == 0
+
+
+np = 0
+
+for i in range(1000):
+    lp = LucasPrime(i)
+    if lp:
+        np = np + 1
+    print("{}:\t{}".format(i, lp))
+
+print(np)