The GCD of given numbers is 50.
Step 1 :
Divide $ 15350 $ by $ 10350 $ and get the remainder
The remainder is positive ($ 5000 > 0 $), so we will continue with division.
Step 2 :
Divide $ 10350 $ by $ \color{blue}{ 5000 } $ and get the remainder
The remainder is still positive ($ 350 > 0 $), so we will continue with division.
Step 3 :
Divide $ 5000 $ by $ \color{blue}{ 350 } $ and get the remainder
The remainder is still positive ($ 100 > 0 $), so we will continue with division.
Step 4 :
Divide $ 350 $ by $ \color{blue}{ 100 } $ and get the remainder
The remainder is still positive ($ 50 > 0 $), so we will continue with division.
Step 5 :
Divide $ 100 $ by $ \color{blue}{ 50 } $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 50 }} $.
We can summarize an algorithm into a following table.
| 15350 | : | 10350 | = | 1 | remainder ( 5000 ) | ||||||||
| 10350 | : | 5000 | = | 2 | remainder ( 350 ) | ||||||||
| 5000 | : | 350 | = | 14 | remainder ( 100 ) | ||||||||
| 350 | : | 100 | = | 3 | remainder ( 50 ) | ||||||||
| 100 | : | 50 | = | 2 | remainder ( 0 ) | ||||||||
| GCD = 50 | |||||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.