Using the Euclidean algorithm with the remainder, we find the GCD of 336 and 176 in a few quick steps:
Use the following properties to reduce the numbers:
GCD(336,176) = GCD(176,336 mod 176) = GCD(176,160)
Repeat the step for the new pair of numbers:
GCD(176,160) = GCD(160,176 mod 160) = GCD(160,16)
In the last step, use the identity GCD(N,0) = N:
GCD(160,16) = GCD(16,160 mod 16) = GCD(16,0) = 16
Read more