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