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