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