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