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