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