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