Find Greatest Common Divisor of 240 and 2450, using Euclidean algorithm.
Answer
The GCD of given numbers is 10.
Explanation
Step 1 :
Divide $ 2450 $ by $ 240 $ and get the remainder
The remainder is positive ($ 50 > 0 $), so we will continue with division.
Step 2 :
Divide $ 240 $ by $ \color{blue}{ 50 } $ and get the remainder
The remainder is still positive ($ 40 > 0 $), so we will continue with division.
Step 3 :
Divide $ 50 $ by $ \color{blue}{ 40 } $ and get the remainder
The remainder is still positive ($ 10 > 0 $), so we will continue with division.
Step 4 :
Divide $ 40 $ by $ \color{blue}{ 10 } $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 10 }} $.
We can summarize an algorithm into a following table.
| 2450 | : | 240 | = | 10 | remainder ( 50 ) | ||||||
| 240 | : | 50 | = | 4 | remainder ( 40 ) | ||||||
| 50 | : | 40 | = | 1 | remainder ( 10 ) | ||||||
| 40 | : | 10 | = | 4 | remainder ( 0 ) | ||||||
| GCD = 10 | |||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.