Find Greatest Common Divisor of 44208 and 88456, using Euclidean algorithm.

Answer

The GCD of given numbers is 8.

Step 1 :
Divide $ 88456 $ by $ 44208 $ and get the remainder

$$ 88456 : 44208 = 2 \text{ ( remainder is } \color{blue}{ 40 } \text{ ) } $$

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

Step 2 :
Divide $ 44208 $ by $ \color{blue}{ 40 } $ and get the remainder

$$ 44208 : 40 = 1105 \text{ ( remainder is } \color{blue}{ 8 } \text{ ) } $$

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

Step 3 :
Divide $ 40 $ by $ \color{blue}{ 8 } $ and get the remainder

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

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

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