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