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