The GCD of given numbers is 1.
Step 1 :
Divide $ 5315135135 $ by $ 566666666 $ and get the remainder
The remainder is positive ($ 215135141 > 0 $), so we will continue with division.
Step 2 :
Divide $ 566666666 $ by $ \color{blue}{ 215135141 } $ and get the remainder
The remainder is still positive ($ 136396384 > 0 $), so we will continue with division.
Step 3 :
Divide $ 215135141 $ by $ \color{blue}{ 136396384 } $ and get the remainder
The remainder is still positive ($ 78738757 > 0 $), so we will continue with division.
Step 4 :
Divide $ 136396384 $ by $ \color{blue}{ 78738757 } $ and get the remainder
The remainder is still positive ($ 57657627 > 0 $), so we will continue with division.
Step 5 :
Divide $ 78738757 $ by $ \color{blue}{ 57657627 } $ and get the remainder
The remainder is still positive ($ 21081130 > 0 $), so we will continue with division.
Step 6 :
Divide $ 57657627 $ by $ \color{blue}{ 21081130 } $ and get the remainder
The remainder is still positive ($ 15495367 > 0 $), so we will continue with division.
Step 7 :
Divide $ 21081130 $ by $ \color{blue}{ 15495367 } $ and get the remainder
The remainder is still positive ($ 5585763 > 0 $), so we will continue with division.
Step 8 :
Divide $ 15495367 $ by $ \color{blue}{ 5585763 } $ and get the remainder
The remainder is still positive ($ 4323841 > 0 $), so we will continue with division.
Step 9 :
Divide $ 5585763 $ by $ \color{blue}{ 4323841 } $ and get the remainder
The remainder is still positive ($ 1261922 > 0 $), so we will continue with division.
Step 10 :
Divide $ 4323841 $ by $ \color{blue}{ 1261922 } $ and get the remainder
The remainder is still positive ($ 538075 > 0 $), so we will continue with division.
Step 11 :
Divide $ 1261922 $ by $ \color{blue}{ 538075 } $ and get the remainder
The remainder is still positive ($ 185772 > 0 $), so we will continue with division.
Step 12 :
Divide $ 538075 $ by $ \color{blue}{ 185772 } $ and get the remainder
The remainder is still positive ($ 166531 > 0 $), so we will continue with division.
Step 13 :
Divide $ 185772 $ by $ \color{blue}{ 166531 } $ and get the remainder
The remainder is still positive ($ 19241 > 0 $), so we will continue with division.
Step 14 :
Divide $ 166531 $ by $ \color{blue}{ 19241 } $ and get the remainder
The remainder is still positive ($ 12603 > 0 $), so we will continue with division.
Step 15 :
Divide $ 19241 $ by $ \color{blue}{ 12603 } $ and get the remainder
The remainder is still positive ($ 6638 > 0 $), so we will continue with division.
Step 16 :
Divide $ 12603 $ by $ \color{blue}{ 6638 } $ and get the remainder
The remainder is still positive ($ 5965 > 0 $), so we will continue with division.
Step 17 :
Divide $ 6638 $ by $ \color{blue}{ 5965 } $ and get the remainder
The remainder is still positive ($ 673 > 0 $), so we will continue with division.
Step 18 :
Divide $ 5965 $ by $ \color{blue}{ 673 } $ and get the remainder
The remainder is still positive ($ 581 > 0 $), so we will continue with division.
Step 19 :
Divide $ 673 $ by $ \color{blue}{ 581 } $ and get the remainder
The remainder is still positive ($ 92 > 0 $), so we will continue with division.
Step 20 :
Divide $ 581 $ by $ \color{blue}{ 92 } $ and get the remainder
The remainder is still positive ($ 29 > 0 $), so we will continue with division.
Step 21 :
Divide $ 92 $ by $ \color{blue}{ 29 } $ and get the remainder
The remainder is still positive ($ 5 > 0 $), so we will continue with division.
Step 22 :
Divide $ 29 $ by $ \color{blue}{ 5 } $ and get the remainder
The remainder is still positive ($ 4 > 0 $), so we will continue with division.
Step 23 :
Divide $ 5 $ by $ \color{blue}{ 4 } $ and get the remainder
The remainder is still positive ($ 1 > 0 $), so we will continue with division.
Step 24 :
Divide $ 4 $ 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.
| 5315135135 | : | 566666666 | = | 9 | remainder ( 215135141 ) | ||||||||||||||||||||||||||||||||||||||||||||||
| 566666666 | : | 215135141 | = | 2 | remainder ( 136396384 ) | ||||||||||||||||||||||||||||||||||||||||||||||
| 215135141 | : | 136396384 | = | 1 | remainder ( 78738757 ) | ||||||||||||||||||||||||||||||||||||||||||||||
| 136396384 | : | 78738757 | = | 1 | remainder ( 57657627 ) | ||||||||||||||||||||||||||||||||||||||||||||||
| 78738757 | : | 57657627 | = | 1 | remainder ( 21081130 ) | ||||||||||||||||||||||||||||||||||||||||||||||
| 57657627 | : | 21081130 | = | 2 | remainder ( 15495367 ) | ||||||||||||||||||||||||||||||||||||||||||||||
| 21081130 | : | 15495367 | = | 1 | remainder ( 5585763 ) | ||||||||||||||||||||||||||||||||||||||||||||||
| 15495367 | : | 5585763 | = | 2 | remainder ( 4323841 ) | ||||||||||||||||||||||||||||||||||||||||||||||
| 5585763 | : | 4323841 | = | 1 | remainder ( 1261922 ) | ||||||||||||||||||||||||||||||||||||||||||||||
| 4323841 | : | 1261922 | = | 3 | remainder ( 538075 ) | ||||||||||||||||||||||||||||||||||||||||||||||
| 1261922 | : | 538075 | = | 2 | remainder ( 185772 ) | ||||||||||||||||||||||||||||||||||||||||||||||
| 538075 | : | 185772 | = | 2 | remainder ( 166531 ) | ||||||||||||||||||||||||||||||||||||||||||||||
| 185772 | : | 166531 | = | 1 | remainder ( 19241 ) | ||||||||||||||||||||||||||||||||||||||||||||||
| 166531 | : | 19241 | = | 8 | remainder ( 12603 ) | ||||||||||||||||||||||||||||||||||||||||||||||
| 19241 | : | 12603 | = | 1 | remainder ( 6638 ) | ||||||||||||||||||||||||||||||||||||||||||||||
| 12603 | : | 6638 | = | 1 | remainder ( 5965 ) | ||||||||||||||||||||||||||||||||||||||||||||||
| 6638 | : | 5965 | = | 1 | remainder ( 673 ) | ||||||||||||||||||||||||||||||||||||||||||||||
| 5965 | : | 673 | = | 8 | remainder ( 581 ) | ||||||||||||||||||||||||||||||||||||||||||||||
| 673 | : | 581 | = | 1 | remainder ( 92 ) | ||||||||||||||||||||||||||||||||||||||||||||||
| 581 | : | 92 | = | 6 | remainder ( 29 ) | ||||||||||||||||||||||||||||||||||||||||||||||
| 92 | : | 29 | = | 3 | remainder ( 5 ) | ||||||||||||||||||||||||||||||||||||||||||||||
| 29 | : | 5 | = | 5 | remainder ( 4 ) | ||||||||||||||||||||||||||||||||||||||||||||||
| 5 | : | 4 | = | 1 | remainder ( 1 ) | ||||||||||||||||||||||||||||||||||||||||||||||
| 4 | : | 1 | = | 4 | remainder ( 0 ) | ||||||||||||||||||||||||||||||||||||||||||||||
| GCD = 1 | |||||||||||||||||||||||||||||||||||||||||||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.