The GCD of given numbers is 10.
Step 1 :
Divide $ 15810 $ by $ 10810 $ and get the remainder
The remainder is positive ($ 5000 > 0 $), so we will continue with division.
Step 2 :
Divide $ 10810 $ by $ \color{blue}{ 5000 } $ and get the remainder
The remainder is still positive ($ 810 > 0 $), so we will continue with division.
Step 3 :
Divide $ 5000 $ by $ \color{blue}{ 810 } $ and get the remainder
The remainder is still positive ($ 140 > 0 $), so we will continue with division.
Step 4 :
Divide $ 810 $ by $ \color{blue}{ 140 } $ and get the remainder
The remainder is still positive ($ 110 > 0 $), so we will continue with division.
Step 5 :
Divide $ 140 $ by $ \color{blue}{ 110 } $ and get the remainder
The remainder is still positive ($ 30 > 0 $), so we will continue with division.
Step 6 :
Divide $ 110 $ by $ \color{blue}{ 30 } $ and get the remainder
The remainder is still positive ($ 20 > 0 $), so we will continue with division.
Step 7 :
Divide $ 30 $ 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.
| 15810 | : | 10810 | = | 1 | remainder ( 5000 ) | ||||||||||||||
| 10810 | : | 5000 | = | 2 | remainder ( 810 ) | ||||||||||||||
| 5000 | : | 810 | = | 6 | remainder ( 140 ) | ||||||||||||||
| 810 | : | 140 | = | 5 | remainder ( 110 ) | ||||||||||||||
| 140 | : | 110 | = | 1 | remainder ( 30 ) | ||||||||||||||
| 110 | : | 30 | = | 3 | remainder ( 20 ) | ||||||||||||||
| 30 | : | 20 | = | 1 | 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.