The GCD of given numbers is 8.
Step 1 :
Divide $ 288 $ by $ 56 $ and get the remainder
The remainder is positive ($ 8 > 0 $), so we will continue with division.
Step 2 :
Divide $ 56 $ 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.
| 288 | : | 56 | = | 5 | remainder ( 8 ) | ||
| 56 | : | 8 | = | 7 | remainder ( 0 ) | ||
| GCD = 8 | |||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.