The GCD of given numbers is 54.
Step 1 :
Divide $ 22086 $ by $ 9990 $ and get the remainder
The remainder is positive ($ 2106 > 0 $), so we will continue with division.
Step 2 :
Divide $ 9990 $ by $ \color{blue}{ 2106 } $ and get the remainder
The remainder is still positive ($ 1566 > 0 $), so we will continue with division.
Step 3 :
Divide $ 2106 $ by $ \color{blue}{ 1566 } $ and get the remainder
The remainder is still positive ($ 540 > 0 $), so we will continue with division.
Step 4 :
Divide $ 1566 $ by $ \color{blue}{ 540 } $ and get the remainder
The remainder is still positive ($ 486 > 0 $), so we will continue with division.
Step 5 :
Divide $ 540 $ by $ \color{blue}{ 486 } $ and get the remainder
The remainder is still positive ($ 54 > 0 $), so we will continue with division.
Step 6 :
Divide $ 486 $ by $ \color{blue}{ 54 } $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 54 }} $.
We can summarize an algorithm into a following table.
| 22086 | : | 9990 | = | 2 | remainder ( 2106 ) | ||||||||||
| 9990 | : | 2106 | = | 4 | remainder ( 1566 ) | ||||||||||
| 2106 | : | 1566 | = | 1 | remainder ( 540 ) | ||||||||||
| 1566 | : | 540 | = | 2 | remainder ( 486 ) | ||||||||||
| 540 | : | 486 | = | 1 | remainder ( 54 ) | ||||||||||
| 486 | : | 54 | = | 9 | remainder ( 0 ) | ||||||||||
| GCD = 54 | |||||||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.