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