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