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