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