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