The GCD of given numbers is 233.
Step 1 :
Divide $ 144227 $ by $ 58483 $ and get the remainder
The remainder is positive ($ 27261 > 0 $), so we will continue with division.
Step 2 :
Divide $ 58483 $ by $ \color{blue}{ 27261 } $ and get the remainder
The remainder is still positive ($ 3961 > 0 $), so we will continue with division.
Step 3 :
Divide $ 27261 $ by $ \color{blue}{ 3961 } $ and get the remainder
The remainder is still positive ($ 3495 > 0 $), so we will continue with division.
Step 4 :
Divide $ 3961 $ by $ \color{blue}{ 3495 } $ and get the remainder
The remainder is still positive ($ 466 > 0 $), so we will continue with division.
Step 5 :
Divide $ 3495 $ by $ \color{blue}{ 466 } $ and get the remainder
The remainder is still positive ($ 233 > 0 $), so we will continue with division.
Step 6 :
Divide $ 466 $ by $ \color{blue}{ 233 } $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 233 }} $.
We can summarize an algorithm into a following table.
| 144227 | : | 58483 | = | 2 | remainder ( 27261 ) | ||||||||||
| 58483 | : | 27261 | = | 2 | remainder ( 3961 ) | ||||||||||
| 27261 | : | 3961 | = | 6 | remainder ( 3495 ) | ||||||||||
| 3961 | : | 3495 | = | 1 | remainder ( 466 ) | ||||||||||
| 3495 | : | 466 | = | 7 | remainder ( 233 ) | ||||||||||
| 466 | : | 233 | = | 2 | remainder ( 0 ) | ||||||||||
| GCD = 233 | |||||||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.