Find Greatest Common Divisor of 7469 and 2464, using Euclidean algorithm.
Answer
The GCD of given numbers is 77.
Explanation
Step 1 :
Divide $ 7469 $ by $ 2464 $ and get the remainder
The remainder is positive ($ 77 > 0 $), so we will continue with division.
Step 2 :
Divide $ 2464 $ by $ \color{blue}{ 77 } $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 77 }} $.
We can summarize an algorithm into a following table.
| 7469 | : | 2464 | = | 3 | remainder ( 77 ) | ||
| 2464 | : | 77 | = | 32 | remainder ( 0 ) | ||
| GCD = 77 | |||||||
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