The GCD of given numbers is 10.
Step 1 :
Divide $ 18290 $ by $ 13290 $ and get the remainder
The remainder is positive ($ 5000 > 0 $), so we will continue with division.
Step 2 :
Divide $ 13290 $ by $ \color{blue}{ 5000 } $ and get the remainder
The remainder is still positive ($ 3290 > 0 $), so we will continue with division.
Step 3 :
Divide $ 5000 $ by $ \color{blue}{ 3290 } $ and get the remainder
The remainder is still positive ($ 1710 > 0 $), so we will continue with division.
Step 4 :
Divide $ 3290 $ by $ \color{blue}{ 1710 } $ and get the remainder
The remainder is still positive ($ 1580 > 0 $), so we will continue with division.
Step 5 :
Divide $ 1710 $ by $ \color{blue}{ 1580 } $ and get the remainder
The remainder is still positive ($ 130 > 0 $), so we will continue with division.
Step 6 :
Divide $ 1580 $ by $ \color{blue}{ 130 } $ and get the remainder
The remainder is still positive ($ 20 > 0 $), so we will continue with division.
Step 7 :
Divide $ 130 $ by $ \color{blue}{ 20 } $ and get the remainder
The remainder is still positive ($ 10 > 0 $), so we will continue with division.
Step 8 :
Divide $ 20 $ by $ \color{blue}{ 10 } $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 10 }} $.
We can summarize an algorithm into a following table.
| 18290 | : | 13290 | = | 1 | remainder ( 5000 ) | ||||||||||||||
| 13290 | : | 5000 | = | 2 | remainder ( 3290 ) | ||||||||||||||
| 5000 | : | 3290 | = | 1 | remainder ( 1710 ) | ||||||||||||||
| 3290 | : | 1710 | = | 1 | remainder ( 1580 ) | ||||||||||||||
| 1710 | : | 1580 | = | 1 | remainder ( 130 ) | ||||||||||||||
| 1580 | : | 130 | = | 12 | remainder ( 20 ) | ||||||||||||||
| 130 | : | 20 | = | 6 | remainder ( 10 ) | ||||||||||||||
| 20 | : | 10 | = | 2 | remainder ( 0 ) | ||||||||||||||
| GCD = 10 | |||||||||||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.