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