modular arithmetic course - challenge 2 - extended euclidean algorithm
This commit is contained in:
parent
716ccc14b3
commit
4b5f6c47ff
2 changed files with 23 additions and 0 deletions
|
|
@ -5,3 +5,24 @@ def gcd(a: int, b: int) -> int:
|
|||
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]
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue