Question
Find Greatest Common Divisor of 95 and 90, using Euclidean algorithm.
Answer
The GCD of given numbers is 5.
Explanation
Step 1 :
Divide by and get the remainder
The remainder is positive (), so we will continue with division.
Step 2 :
Divide by and get the remainder
The remainder is zero => GCD is the last divisor .
We can summarize an algorithm into a following table.
| 95 | : | 90 | = | 1 | remainder ( 5 ) | ||
| 90 | : | 5 | = | 18 | remainder ( 0 ) | ||
| GCD = 5 | |||||||
This solution can be visualized using a Venn diagram.
0,0
95
90
5
19
2
3
3
The GCD equals the product of the numbers at the intersection.
This page was created using
GCD Calculator