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