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