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