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