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