Find Greatest Common Divisor of 252 and 105, using Euclidean algorithm.

Answer

The GCD of given numbers is 21.

Step 1 :
Divide $ 252 $ by $ 105 $ and get the remainder

$$ 252 : 105 = 2 \text{ ( remainder is } \color{blue}{ 42 } \text{ ) } $$

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

Step 2 :
Divide $ 105 $ by $ \color{blue}{ 42 } $ and get the remainder

$$ 105 : 42 = 2 \text{ ( remainder is } \color{blue}{ 21 } \text{ ) } $$

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

Step 3 :
Divide $ 42 $ by $ \color{blue}{ 21 } $ and get the remainder

$$ 42 : \color{blue}{ \boxed { 21 }} = 2 \text{ ( remainder is } \color{blue}{ 0 } \text{ ) } $$

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

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