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