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