From f8fe8fe41f74c8ecc5c8555ca43d65bd12b4f073 Mon Sep 17 00:00:00 2001
From: aryan1165 <111041731+aryan1165@users.noreply.github.com>
Date: Tue, 3 Oct 2023 03:27:00 +0530
Subject: [PATCH] Removed maths/miller_rabin.py , Double implementation. #8098
 (#9228)

* Removed ciphers/rabin_miller.py as it is already there maths/miller_rabin.py

* Renamed miller_rabin.py to rabain_miller.py

* Restore ciphers/rabin_miller.py and removed maths/rabin_miller.py
---
 maths/miller_rabin.py | 51 -------------------------------------------
 1 file changed, 51 deletions(-)
 delete mode 100644 maths/miller_rabin.py

diff --git a/maths/miller_rabin.py b/maths/miller_rabin.py
deleted file mode 100644
index 9f2668dba..000000000
--- a/maths/miller_rabin.py
+++ /dev/null
@@ -1,51 +0,0 @@
-import random
-
-from .binary_exp_mod import bin_exp_mod
-
-
-# This is a probabilistic check to test primality, useful for big numbers!
-# if it's a prime, it will return true
-# if it's not a prime, the chance of it returning true is at most 1/4**prec
-def is_prime_big(n, prec=1000):
-    """
-    >>> from maths.prime_check import is_prime
-    >>> # all(is_prime_big(i) == is_prime(i) for i in range(1000))  # 3.45s
-    >>> all(is_prime_big(i) == is_prime(i) for i in range(256))
-    True
-    """
-    if n < 2:
-        return False
-
-    if n % 2 == 0:
-        return n == 2
-
-    # this means n is odd
-    d = n - 1
-    exp = 0
-    while d % 2 == 0:
-        d /= 2
-        exp += 1
-
-    # n - 1=d*(2**exp)
-    count = 0
-    while count < prec:
-        a = random.randint(2, n - 1)
-        b = bin_exp_mod(a, d, n)
-        if b != 1:
-            flag = True
-            for _ in range(exp):
-                if b == n - 1:
-                    flag = False
-                    break
-                b = b * b
-                b %= n
-            if flag:
-                return False
-            count += 1
-    return True
-
-
-if __name__ == "__main__":
-    n = abs(int(input("Enter bound : ").strip()))
-    print("Here's the list of primes:")
-    print(", ".join(str(i) for i in range(n + 1) if is_prime_big(i)))