扩展欧几里得算法+Python代码
算法原理
![](https://img2018.cnblogs.com/blog/1462316/201910/1462316-20191009165318635-397495233.png)
![](https://img2018.cnblogs.com/blog/1462316/201910/1462316-20191009165739335-1413457166.png)
![](https://img2018.cnblogs.com/blog/1462316/201910/1462316-20191009170250092-1749584008.png)
![](https://img2018.cnblogs.com/blog/1462316/201910/1462316-20191009170709330-1880596445.png)
![](https://img2018.cnblogs.com/blog/1462316/201910/1462316-20191009171247830-1621106596.png)
![](https://img2018.cnblogs.com/blog/1462316/201910/1462316-20191009172310484-2005927488.png)
Python代码
def myExtGCD(a, b):
"""
a: 模的取值
b: 想求逆的值
"""
if (b == 0):
return 1, 0, a
x, y, gcd = myExtGCD(b, a % b)
return y, x-a//b*y, gcd
print(myExtGCD(71, 7)[1] % 71)
def myExtGCD(a, b):
"""
a: 模的取值
b: 想求逆的值
"""
if (b == 0):
return 1, 0, a
x, y, gcd = myExtGCD(b, a % b)
return y, x-a//b*y, gcd
print(myExtGCD(71, 7)[1] % 71)