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