// Euclid’s algorithm, exemplified for J = 1980, K = 1617 as follows: ...

The greatest common divisor of two positive integers is the largest integer that divides each of them without remainder. For example, gcd(2, 12) = 2 gcd(6, 12) = 6 gcd(9, 12) = 3 gcd(17, 12) = 1 A ...