# Challenge 1 - gcd def gcd(a: int, b: int) -> int: while b != 0: r = a % b a = b b = r return a # Challenge 2 - extended Euclidean algorithm def extended_gcd(a: int, b: int) -> (int, int, int): """ Args: a: an integer b: an integer Returns: (gcd, u, v) so that u*a + v*b = gcd """ u = [1, 0] v = [0, 1] while b != 0: r = a % b q = a // b u.append(u[-2] - u[-1] * q) v.append(v[-2] - v[-1] * q) a = b b = r return a, u[-2], v[-2] # Challenge 6 - quadratic residues def quadratic_residue(N: int, x: int): """Find the quadratic residue of x mod N. Args: N: a prime integer x: the integer for which we look for a quadratic residue. Returns: Either none or the square root of x mod N. """ for i in range(N): if pow(i, 2, N) == x: return i return None