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