Greatest Common Divisor (GCD)
Description
Find the Greatest Common Divisor (GCD) of two integers A and B.
The Euclidean algorithm is defined by the recurrence:
$\gcd(A, B) = \gcd(B, A \bmod B) \text{ for } B \neq 0
\gcd(A, 0) = A
Find the Greatest Common Divisor (GCD) of two integers A and B.
The Euclidean algorithm is defined by the recurrence:
$\gcd(A, B) = \gcd(B, A \bmod B) \text{ for } B \neq 0
\gcd(A, 0) = A