The GCD of given numbers is 1.
Step 1 :
Divide $ 9973 $ by $ 6392 $ and get the remainder
The remainder is positive ($ 3581 > 0 $), so we will continue with division.
Step 2 :
Divide $ 6392 $ by $ \color{blue}{ 3581 } $ and get the remainder
The remainder is still positive ($ 2811 > 0 $), so we will continue with division.
Step 3 :
Divide $ 3581 $ by $ \color{blue}{ 2811 } $ and get the remainder
The remainder is still positive ($ 770 > 0 $), so we will continue with division.
Step 4 :
Divide $ 2811 $ by $ \color{blue}{ 770 } $ and get the remainder
The remainder is still positive ($ 501 > 0 $), so we will continue with division.
Step 5 :
Divide $ 770 $ by $ \color{blue}{ 501 } $ and get the remainder
The remainder is still positive ($ 269 > 0 $), so we will continue with division.
Step 6 :
Divide $ 501 $ by $ \color{blue}{ 269 } $ and get the remainder
The remainder is still positive ($ 232 > 0 $), so we will continue with division.
Step 7 :
Divide $ 269 $ by $ \color{blue}{ 232 } $ and get the remainder
The remainder is still positive ($ 37 > 0 $), so we will continue with division.
Step 8 :
Divide $ 232 $ by $ \color{blue}{ 37 } $ and get the remainder
The remainder is still positive ($ 10 > 0 $), so we will continue with division.
Step 9 :
Divide $ 37 $ by $ \color{blue}{ 10 } $ and get the remainder
The remainder is still positive ($ 7 > 0 $), so we will continue with division.
Step 10 :
Divide $ 10 $ by $ \color{blue}{ 7 } $ and get the remainder
The remainder is still positive ($ 3 > 0 $), so we will continue with division.
Step 11 :
Divide $ 7 $ by $ \color{blue}{ 3 } $ and get the remainder
The remainder is still positive ($ 1 > 0 $), so we will continue with division.
Step 12 :
Divide $ 3 $ 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.
| 9973 | : | 6392 | = | 1 | remainder ( 3581 ) | ||||||||||||||||||||||
| 6392 | : | 3581 | = | 1 | remainder ( 2811 ) | ||||||||||||||||||||||
| 3581 | : | 2811 | = | 1 | remainder ( 770 ) | ||||||||||||||||||||||
| 2811 | : | 770 | = | 3 | remainder ( 501 ) | ||||||||||||||||||||||
| 770 | : | 501 | = | 1 | remainder ( 269 ) | ||||||||||||||||||||||
| 501 | : | 269 | = | 1 | remainder ( 232 ) | ||||||||||||||||||||||
| 269 | : | 232 | = | 1 | remainder ( 37 ) | ||||||||||||||||||||||
| 232 | : | 37 | = | 6 | remainder ( 10 ) | ||||||||||||||||||||||
| 37 | : | 10 | = | 3 | remainder ( 7 ) | ||||||||||||||||||||||
| 10 | : | 7 | = | 1 | remainder ( 3 ) | ||||||||||||||||||||||
| 7 | : | 3 | = | 2 | remainder ( 1 ) | ||||||||||||||||||||||
| 3 | : | 1 | = | 3 | remainder ( 0 ) | ||||||||||||||||||||||
| GCD = 1 | |||||||||||||||||||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.