The GCD of given numbers is 1.
Step 1 :
Divide $ 227 $ by $ 143 $ and get the remainder
The remainder is positive ($ 84 > 0 $), so we will continue with division.
Step 2 :
Divide $ 143 $ by $ \color{blue}{ 84 } $ and get the remainder
The remainder is still positive ($ 59 > 0 $), so we will continue with division.
Step 3 :
Divide $ 84 $ by $ \color{blue}{ 59 } $ and get the remainder
The remainder is still positive ($ 25 > 0 $), so we will continue with division.
Step 4 :
Divide $ 59 $ by $ \color{blue}{ 25 } $ and get the remainder
The remainder is still positive ($ 9 > 0 $), so we will continue with division.
Step 5 :
Divide $ 25 $ by $ \color{blue}{ 9 } $ and get the remainder
The remainder is still positive ($ 7 > 0 $), so we will continue with division.
Step 6 :
Divide $ 9 $ by $ \color{blue}{ 7 } $ and get the remainder
The remainder is still positive ($ 2 > 0 $), so we will continue with division.
Step 7 :
Divide $ 7 $ by $ \color{blue}{ 2 } $ and get the remainder
The remainder is still positive ($ 1 > 0 $), so we will continue with division.
Step 8 :
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.
| 227 | : | 143 | = | 1 | remainder ( 84 ) | ||||||||||||||
| 143 | : | 84 | = | 1 | remainder ( 59 ) | ||||||||||||||
| 84 | : | 59 | = | 1 | remainder ( 25 ) | ||||||||||||||
| 59 | : | 25 | = | 2 | remainder ( 9 ) | ||||||||||||||
| 25 | : | 9 | = | 2 | remainder ( 7 ) | ||||||||||||||
| 9 | : | 7 | = | 1 | remainder ( 2 ) | ||||||||||||||
| 7 | : | 2 | = | 3 | 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.