The GCD of given numbers is 1.
Step 1 :
Divide $ 1793 $ by $ 1701 $ and get the remainder
The remainder is positive ($ 92 > 0 $), so we will continue with division.
Step 2 :
Divide $ 1701 $ by $ \color{blue}{ 92 } $ and get the remainder
The remainder is still positive ($ 45 > 0 $), so we will continue with division.
Step 3 :
Divide $ 92 $ by $ \color{blue}{ 45 } $ and get the remainder
The remainder is still positive ($ 2 > 0 $), so we will continue with division.
Step 4 :
Divide $ 45 $ by $ \color{blue}{ 2 } $ and get the remainder
The remainder is still positive ($ 1 > 0 $), so we will continue with division.
Step 5 :
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.
| 1793 | : | 1701 | = | 1 | remainder ( 92 ) | ||||||||
| 1701 | : | 92 | = | 18 | remainder ( 45 ) | ||||||||
| 92 | : | 45 | = | 2 | remainder ( 2 ) | ||||||||
| 45 | : | 2 | = | 22 | 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.