Find Greatest Common Divisor of 111 and 201, using Euclidean algorithm.
Answer
The GCD of given numbers is 3.
Explanation
Step 1 :
Divide $ 201 $ by $ 111 $ and get the remainder
The remainder is positive ($ 90 > 0 $), so we will continue with division.
Step 2 :
Divide $ 111 $ by $ \color{blue}{ 90 } $ and get the remainder
The remainder is still positive ($ 21 > 0 $), so we will continue with division.
Step 3 :
Divide $ 90 $ by $ \color{blue}{ 21 } $ and get the remainder
The remainder is still positive ($ 6 > 0 $), so we will continue with division.
Step 4 :
Divide $ 21 $ by $ \color{blue}{ 6 } $ and get the remainder
The remainder is still positive ($ 3 > 0 $), so we will continue with division.
Step 5 :
Divide $ 6 $ 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.
| 201 | : | 111 | = | 1 | remainder ( 90 ) | ||||||||
| 111 | : | 90 | = | 1 | remainder ( 21 ) | ||||||||
| 90 | : | 21 | = | 4 | remainder ( 6 ) | ||||||||
| 21 | : | 6 | = | 3 | remainder ( 3 ) | ||||||||
| 6 | : | 3 | = | 2 | remainder ( 0 ) | ||||||||
| GCD = 3 | |||||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.