The GCD of given numbers is 1013.
Step 1 :
Divide $ 11143 $ by $ 1013 $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 1013 }} $.
We can summarize an algorithm into a following table.
11143 | : | 1013 | = | 11 | remainder ( 0 ) |
GCD = 1013 |
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.