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