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