Cryptography, Cybersecurity.
Remainder; return a; g = gcd(679,99) print g A sample run shows that 679 and 99 do not share any factors: a:679, b:99, Remainder:85 a:99, b:85, Remainder:14 a:85, b:14, Remainder:1 a:14, b:1, Remainder:0 Return value:1 Web: https://asecuritysite.com/encryption/gcd Extended GCD GCD is the greatest