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