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