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