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