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