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