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