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