Find Greatest Common Divisor of 13 and 91, using Euclidean algorithm.
Answer
The GCD of given numbers is 13.
Explanation
Step 1 :
Divide $ 91 $ by $ 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.
| 91 | : | 13 | = | 7 | 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