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