Make two versions of Baillie-PSW test

bailliePSW.py

+from psimp import in_100, hund_div
+from lucas import LucasPrime, StrongLucasPrime
+from millerrabin import MillerRabin
+from sieve import sieval
+from time import process_time
+
+
+def BailliePSW(n):
+    if n < 2:
+        return False
+    if in_100(n):
+        return True
+    if hund_div(n) != 0:
+        return False
+    if MillerRabin(n, 2):
+        return False
+    return StrongLucasPrime(n)
+
+
+def BailliePSWWeak(n):
+    if n < 2:
+        return False
+    if in_100(n):
+        return True
+    if hund_div(n) != 0:
+        return False
+    if MillerRabin(n, 2):
+        return False
+    return LucasPrime(n)

millerrabin.py

         if x == n - 1:
             return False
     return True
-
-
-# Print pseudoprimes greater than 100 for each base, from base 1 to 15
-for base in range(2, 16):
-    print("{}:".format(base))
-    for i in range(2, 10000):
-        if i % 2 == 0 or base % i == 0:
-            continue
-        if MillerRabin(i, base) == (p.hund_div(i) == 0):
-            print(i, p.hund_div(i), MillerRabin(i, base))
-    print()
-
-MillerRabin(28, 3)
-print(pow(3, 27, 28))
-print(pow(3, 27))
-print(pow(3, 27) % 28)