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