"Highest Common Divisor"
Source:
February 6, 2009
algorithmnumber theoryEuclidean algorithm
Problem Statement
If the Highest Common Divisor of and is diminished by , it will equal:
(A)\ \minus{}6 \qquad
(B)\ 6 \qquad
(C)\ \minus{}2 \qquad
(D)\ 3 \qquad
(E)\ 4