The GCD of given numbers is 10.
Step 1 :
Divide $ 17330 $ by $ 12330 $ and get the remainder
The remainder is positive ($ 5000 > 0 $), so we will continue with division.
Step 2 :
Divide $ 12330 $ by $ \color{blue}{ 5000 } $ and get the remainder
The remainder is still positive ($ 2330 > 0 $), so we will continue with division.
Step 3 :
Divide $ 5000 $ by $ \color{blue}{ 2330 } $ and get the remainder
The remainder is still positive ($ 340 > 0 $), so we will continue with division.
Step 4 :
Divide $ 2330 $ by $ \color{blue}{ 340 } $ and get the remainder
The remainder is still positive ($ 290 > 0 $), so we will continue with division.
Step 5 :
Divide $ 340 $ by $ \color{blue}{ 290 } $ and get the remainder
The remainder is still positive ($ 50 > 0 $), so we will continue with division.
Step 6 :
Divide $ 290 $ by $ \color{blue}{ 50 } $ and get the remainder
The remainder is still positive ($ 40 > 0 $), so we will continue with division.
Step 7 :
Divide $ 50 $ by $ \color{blue}{ 40 } $ and get the remainder
The remainder is still positive ($ 10 > 0 $), so we will continue with division.
Step 8 :
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.
| 17330 | : | 12330 | = | 1 | remainder ( 5000 ) | ||||||||||||||
| 12330 | : | 5000 | = | 2 | remainder ( 2330 ) | ||||||||||||||
| 5000 | : | 2330 | = | 2 | remainder ( 340 ) | ||||||||||||||
| 2330 | : | 340 | = | 6 | remainder ( 290 ) | ||||||||||||||
| 340 | : | 290 | = | 1 | remainder ( 50 ) | ||||||||||||||
| 290 | : | 50 | = | 5 | 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.