Miller-Rabin Primality Test Python Implementation

primetest.py

# Python Version : 3.10.6 64-bit
def main():
    number = int(input("Insert an odd number: "))
    #step 1 - select a number in this range (n > 2)
    if(number <= 2 and 
    number % 2 == 0):
        print("Please insert an odd number in this range (n > 2) ")
        return
    
#step 2 -- n - 1 = 2^k \times m

    k = 0
    m = 0
    if ((number - 1) % 2 == 0):
        k = (number - 1) // 2
        while (k % 2 == 0):
            k = k // 2
        m = (number - 1) // k
        print("k = {0}, m = {1}".format(k, m))
    else:
        print("error")
        return
    
#step 3 -- $b_i = 2^m (mod n) \mp 1
# \mp = minusplus
# ** = ^

    b = (2 ** k) % number
    while True:
        if(b == 1):
            print("{0} is prime".format(number))
            return
        if(b == -1):
            print("{0} is not prime".format(number))
            return
        b = b ** 2 % number

if __name__ == '__main__':
    main()