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