The GCD of given numbers is 32.
Step 1 :
Divide $ 160 $ by $ 64 $ and get the remainder
The remainder is positive ($ 32 > 0 $), so we will continue with division.
Step 2 :
Divide $ 64 $ by $ \color{blue}{ 32 } $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 32 }} $.
We can summarize an algorithm into a following table.
160 | : | 64 | = | 2 | remainder ( 32 ) | ||
64 | : | 32 | = | 2 | remainder ( 0 ) | ||
GCD = 32 |
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.