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