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