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