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