Find Greatest Common Divisor of 7373 and 5548, using Euclidean algorithm.

Answer

The GCD of given numbers is 73.

Step 1 :
Divide $ 7373 $ by $ 5548 $ and get the remainder

$$ 7373 : 5548 = 1 \text{ ( remainder is } \color{blue}{ 1825 } \text{ ) } $$

The remainder is positive ($ 1825 > 0 $), so we will continue with division.

Step 2 :
Divide $ 5548 $ by $ \color{blue}{ 1825 } $ and get the remainder

$$ 5548 : 1825 = 3 \text{ ( remainder is } \color{blue}{ 73 } \text{ ) } $$

The remainder is still positive ($ 73 > 0 $), so we will continue with division.

Step 3 :
Divide $ 1825 $ by $ \color{blue}{ 73 } $ and get the remainder

$$ 1825 : \color{blue}{ \boxed { 73 }} = 25 \text{ ( remainder is } \color{blue}{ 0 } \text{ ) } $$

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

We can summarize an algorithm into a following table.

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