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