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