The GCD of given numbers is 1.
Step 1 :
Divide $ 31145 $ by $ 11442 $ and get the remainder
The remainder is positive ($ 8261 > 0 $), so we will continue with division.
Step 2 :
Divide $ 11442 $ by $ \color{blue}{ 8261 } $ and get the remainder
The remainder is still positive ($ 3181 > 0 $), so we will continue with division.
Step 3 :
Divide $ 8261 $ by $ \color{blue}{ 3181 } $ and get the remainder
The remainder is still positive ($ 1899 > 0 $), so we will continue with division.
Step 4 :
Divide $ 3181 $ by $ \color{blue}{ 1899 } $ and get the remainder
The remainder is still positive ($ 1282 > 0 $), so we will continue with division.
Step 5 :
Divide $ 1899 $ by $ \color{blue}{ 1282 } $ and get the remainder
The remainder is still positive ($ 617 > 0 $), so we will continue with division.
Step 6 :
Divide $ 1282 $ by $ \color{blue}{ 617 } $ and get the remainder
The remainder is still positive ($ 48 > 0 $), so we will continue with division.
Step 7 :
Divide $ 617 $ by $ \color{blue}{ 48 } $ and get the remainder
The remainder is still positive ($ 41 > 0 $), so we will continue with division.
Step 8 :
Divide $ 48 $ by $ \color{blue}{ 41 } $ and get the remainder
The remainder is still positive ($ 7 > 0 $), so we will continue with division.
Step 9 :
Divide $ 41 $ by $ \color{blue}{ 7 } $ and get the remainder
The remainder is still positive ($ 6 > 0 $), so we will continue with division.
Step 10 :
Divide $ 7 $ by $ \color{blue}{ 6 } $ and get the remainder
The remainder is still positive ($ 1 > 0 $), so we will continue with division.
Step 11 :
Divide $ 6 $ by $ \color{blue}{ 1 } $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 1 }} $.
We can summarize an algorithm into a following table.
| 31145 | : | 11442 | = | 2 | remainder ( 8261 ) | ||||||||||||||||||||
| 11442 | : | 8261 | = | 1 | remainder ( 3181 ) | ||||||||||||||||||||
| 8261 | : | 3181 | = | 2 | remainder ( 1899 ) | ||||||||||||||||||||
| 3181 | : | 1899 | = | 1 | remainder ( 1282 ) | ||||||||||||||||||||
| 1899 | : | 1282 | = | 1 | remainder ( 617 ) | ||||||||||||||||||||
| 1282 | : | 617 | = | 2 | remainder ( 48 ) | ||||||||||||||||||||
| 617 | : | 48 | = | 12 | remainder ( 41 ) | ||||||||||||||||||||
| 48 | : | 41 | = | 1 | remainder ( 7 ) | ||||||||||||||||||||
| 41 | : | 7 | = | 5 | remainder ( 6 ) | ||||||||||||||||||||
| 7 | : | 6 | = | 1 | remainder ( 1 ) | ||||||||||||||||||||
| 6 | : | 1 | = | 6 | remainder ( 0 ) | ||||||||||||||||||||
| GCD = 1 | |||||||||||||||||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.