|
@@ -37,19 +37,3 @@ def MillerRabin(n, base):
|
37
|
37
|
if x == n - 1:
|
38
|
38
|
return False
|
39
|
39
|
return True
|
40
|
|
-
|
41
|
|
-
|
42
|
|
-# Print pseudoprimes greater than 100 for each base, from base 1 to 15
|
43
|
|
-for base in range(2, 16):
|
44
|
|
- print("{}:".format(base))
|
45
|
|
- for i in range(2, 10000):
|
46
|
|
- if i % 2 == 0 or base % i == 0:
|
47
|
|
- continue
|
48
|
|
- if MillerRabin(i, base) == (p.hund_div(i) == 0):
|
49
|
|
- print(i, p.hund_div(i), MillerRabin(i, base))
|
50
|
|
- print()
|
51
|
|
-
|
52
|
|
-MillerRabin(28, 3)
|
53
|
|
-print(pow(3, 27, 28))
|
54
|
|
-print(pow(3, 27))
|
55
|
|
-print(pow(3, 27) % 28)
|