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