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