Question
Find Greatest Common Divisor of 44 and 97, using Euclidean algorithm.
Answer
The GCD of given numbers is 1.
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 still positive (), so we will continue with division.
Step 3 :
Divide by and get the remainder
The remainder is still positive (), so we will continue with division.
Step 4 :
Divide by and get the remainder
The remainder is zero => GCD is the last divisor .
We can summarize an algorithm into a following table.
| 97 | : | 44 | = | 2 | remainder ( 9 ) | ||||||
| 44 | : | 9 | = | 4 | remainder ( 8 ) | ||||||
| 9 | : | 8 | = | 1 | remainder ( 1 ) | ||||||
| 8 | : | 1 | = | 8 | remainder ( 0 ) | ||||||
| GCD = 1 | |||||||||||
This solution can be visualized using a Venn diagram.
0,0
44
97
1
2
2
11
97
The GCD equals the product of the numbers at the intersection.
This page was created using
GCD Calculator