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