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