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