Math Calculators, Lessons and Formulas

It is time to solve your math problem

mathportal.org

◀ back to index

Question

Find Greatest Common Divisor of 130 and 26, using Euclidean algorithm.

Answer

The GCD of given numbers is 26.

Explanation

Step 1 :
Divide $ 130 $ by $ 26 $ and get the remainder

$$ 130 : \color{blue}{ \boxed { 26 }} = 5 \text{ ( remainder is } \color{blue}{ 0 } \text{ ) } $$

The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 26 }} $.

We can summarize an algorithm into a following table.

130 : 26 = 5 remainder ( 0 )
GCD = 26

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