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