The GCD of given numbers is 16.
Step 1 :
Divide $ 272 $ by $ 192 $ and get the remainder
The remainder is positive ($ 80 > 0 $), so we will continue with division.
Step 2 :
Divide $ 192 $ by $ \color{blue}{ 80 } $ and get the remainder
The remainder is still positive ($ 32 > 0 $), so we will continue with division.
Step 3 :
Divide $ 80 $ by $ \color{blue}{ 32 } $ and get the remainder
The remainder is still positive ($ 16 > 0 $), so we will continue with division.
Step 4 :
Divide $ 32 $ 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.
| 272 | : | 192 | = | 1 | remainder ( 80 ) | ||||||
| 192 | : | 80 | = | 2 | remainder ( 32 ) | ||||||
| 80 | : | 32 | = | 2 | remainder ( 16 ) | ||||||
| 32 | : | 16 | = | 2 | remainder ( 0 ) | ||||||
| GCD = 16 | |||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.