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