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