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