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