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