The GCD of given numbers is 10.
Step 1 :
Divide $ 15490 $ by $ 10490 $ and get the remainder
The remainder is positive ($ 5000 > 0 $), so we will continue with division.
Step 2 :
Divide $ 10490 $ by $ \color{blue}{ 5000 } $ and get the remainder
The remainder is still positive ($ 490 > 0 $), so we will continue with division.
Step 3 :
Divide $ 5000 $ by $ \color{blue}{ 490 } $ and get the remainder
The remainder is still positive ($ 100 > 0 $), so we will continue with division.
Step 4 :
Divide $ 490 $ by $ \color{blue}{ 100 } $ and get the remainder
The remainder is still positive ($ 90 > 0 $), so we will continue with division.
Step 5 :
Divide $ 100 $ by $ \color{blue}{ 90 } $ and get the remainder
The remainder is still positive ($ 10 > 0 $), so we will continue with division.
Step 6 :
Divide $ 90 $ 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.
| 15490 | : | 10490 | = | 1 | remainder ( 5000 ) | ||||||||||
| 10490 | : | 5000 | = | 2 | remainder ( 490 ) | ||||||||||
| 5000 | : | 490 | = | 10 | remainder ( 100 ) | ||||||||||
| 490 | : | 100 | = | 4 | remainder ( 90 ) | ||||||||||
| 100 | : | 90 | = | 1 | remainder ( 10 ) | ||||||||||
| 90 | : | 10 | = | 9 | remainder ( 0 ) | ||||||||||
| GCD = 10 | |||||||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.