Find Greatest Common Divisor of 62 and 30, using Euclidean algorithm.
Answer
The GCD of given numbers is 2.
Explanation
Step 1 :
Divide $ 62 $ by $ 30 $ and get the remainder
The remainder is positive ($ 2 > 0 $), so we will continue with division.
Step 2 :
Divide $ 30 $ 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.
| 62 | : | 30 | = | 2 | remainder ( 2 ) | ||
| 30 | : | 2 | = | 15 | remainder ( 0 ) | ||
| GCD = 2 | |||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.
This page was created using
GCD Calculator