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