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