The GCD of given numbers is 21.
Step 1 :
Divide $ 9723 $ by $ 168 $ and get the remainder
The remainder is positive ($ 147 > 0 $), so we will continue with division.
Step 2 :
Divide $ 168 $ by $ \color{blue}{ 147 } $ and get the remainder
The remainder is still positive ($ 21 > 0 $), so we will continue with division.
Step 3 :
Divide $ 147 $ 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.
| 9723 | : | 168 | = | 57 | remainder ( 147 ) | ||||
| 168 | : | 147 | = | 1 | remainder ( 21 ) | ||||
| 147 | : | 21 | = | 7 | remainder ( 0 ) | ||||
| GCD = 21 | |||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.