The GCD of given numbers is 4.
Step 1 :
Divide $ 31256 $ by $ 4788 $ and get the remainder
The remainder is positive ($ 2528 > 0 $), so we will continue with division.
Step 2 :
Divide $ 4788 $ by $ \color{blue}{ 2528 } $ and get the remainder
The remainder is still positive ($ 2260 > 0 $), so we will continue with division.
Step 3 :
Divide $ 2528 $ by $ \color{blue}{ 2260 } $ and get the remainder
The remainder is still positive ($ 268 > 0 $), so we will continue with division.
Step 4 :
Divide $ 2260 $ by $ \color{blue}{ 268 } $ and get the remainder
The remainder is still positive ($ 116 > 0 $), so we will continue with division.
Step 5 :
Divide $ 268 $ by $ \color{blue}{ 116 } $ and get the remainder
The remainder is still positive ($ 36 > 0 $), so we will continue with division.
Step 6 :
Divide $ 116 $ by $ \color{blue}{ 36 } $ and get the remainder
The remainder is still positive ($ 8 > 0 $), so we will continue with division.
Step 7 :
Divide $ 36 $ by $ \color{blue}{ 8 } $ and get the remainder
The remainder is still positive ($ 4 > 0 $), so we will continue with division.
Step 8 :
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.
| 31256 | : | 4788 | = | 6 | remainder ( 2528 ) | ||||||||||||||
| 4788 | : | 2528 | = | 1 | remainder ( 2260 ) | ||||||||||||||
| 2528 | : | 2260 | = | 1 | remainder ( 268 ) | ||||||||||||||
| 2260 | : | 268 | = | 8 | remainder ( 116 ) | ||||||||||||||
| 268 | : | 116 | = | 2 | remainder ( 36 ) | ||||||||||||||
| 116 | : | 36 | = | 3 | remainder ( 8 ) | ||||||||||||||
| 36 | : | 8 | = | 4 | 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.