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