Find Greatest Common Divisor of 60 and 30, using Euclidean algorithm.
Answer
The GCD of given numbers is 30.
Explanation
Step 1 :
Divide $ 60 $ by $ 30 $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 30 }} $.
We can summarize an algorithm into a following table.
| 60 | : | 30 | = | 2 | remainder ( 0 ) |
| GCD = 30 | |||||
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