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