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