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