The GCD of given numbers is 4.
Step 1 :
Divide $ 3568 $ by $ 1604 $ and get the remainder
The remainder is positive ($ 360 > 0 $), so we will continue with division.
Step 2 :
Divide $ 1604 $ by $ \color{blue}{ 360 } $ and get the remainder
The remainder is still positive ($ 164 > 0 $), so we will continue with division.
Step 3 :
Divide $ 360 $ by $ \color{blue}{ 164 } $ and get the remainder
The remainder is still positive ($ 32 > 0 $), so we will continue with division.
Step 4 :
Divide $ 164 $ by $ \color{blue}{ 32 } $ and get the remainder
The remainder is still positive ($ 4 > 0 $), so we will continue with division.
Step 5 :
Divide $ 32 $ 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.
| 3568 | : | 1604 | = | 2 | remainder ( 360 ) | ||||||||
| 1604 | : | 360 | = | 4 | remainder ( 164 ) | ||||||||
| 360 | : | 164 | = | 2 | remainder ( 32 ) | ||||||||
| 164 | : | 32 | = | 5 | remainder ( 4 ) | ||||||||
| 32 | : | 4 | = | 8 | remainder ( 0 ) | ||||||||
| GCD = 4 | |||||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.