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