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