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