EGCD (1) 썸네일형 리스트형 [CryptoHack] Modular Arithmetic (1) from math import * print(gcd(12,8)) print(gcd(66528,52920)) https://web.archive.org/web/20230511143526/http://www-math.ucdenver.edu/~wcherowi/courses/m5410/exeucalg.html Extended Euclidean Algorithm The Extended Euclidean Algorithm As we know from grade school, when we divide one integer by another (nonzero) integer we get an integer quotient (the "answer") plus a remainder (generally a rational.. 이전 1 다음
