The GCD of given numbers is 1.
Step 1 :
Divide $ 928374827 $ by $ 57842515 $ and get the remainder
The remainder is positive ($ 2894587 > 0 $), so we will continue with division.
Step 2 :
Divide $ 57842515 $ by $ \color{blue}{ 2894587 } $ and get the remainder
The remainder is still positive ($ 2845362 > 0 $), so we will continue with division.
Step 3 :
Divide $ 2894587 $ by $ \color{blue}{ 2845362 } $ and get the remainder
The remainder is still positive ($ 49225 > 0 $), so we will continue with division.
Step 4 :
Divide $ 2845362 $ by $ \color{blue}{ 49225 } $ and get the remainder
The remainder is still positive ($ 39537 > 0 $), so we will continue with division.
Step 5 :
Divide $ 49225 $ by $ \color{blue}{ 39537 } $ and get the remainder
The remainder is still positive ($ 9688 > 0 $), so we will continue with division.
Step 6 :
Divide $ 39537 $ by $ \color{blue}{ 9688 } $ and get the remainder
The remainder is still positive ($ 785 > 0 $), so we will continue with division.
Step 7 :
Divide $ 9688 $ by $ \color{blue}{ 785 } $ and get the remainder
The remainder is still positive ($ 268 > 0 $), so we will continue with division.
Step 8 :
Divide $ 785 $ by $ \color{blue}{ 268 } $ and get the remainder
The remainder is still positive ($ 249 > 0 $), so we will continue with division.
Step 9 :
Divide $ 268 $ by $ \color{blue}{ 249 } $ and get the remainder
The remainder is still positive ($ 19 > 0 $), so we will continue with division.
Step 10 :
Divide $ 249 $ by $ \color{blue}{ 19 } $ and get the remainder
The remainder is still positive ($ 2 > 0 $), so we will continue with division.
Step 11 :
Divide $ 19 $ by $ \color{blue}{ 2 } $ and get the remainder
The remainder is still positive ($ 1 > 0 $), so we will continue with division.
Step 12 :
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.
| 928374827 | : | 57842515 | = | 16 | remainder ( 2894587 ) | ||||||||||||||||||||||
| 57842515 | : | 2894587 | = | 19 | remainder ( 2845362 ) | ||||||||||||||||||||||
| 2894587 | : | 2845362 | = | 1 | remainder ( 49225 ) | ||||||||||||||||||||||
| 2845362 | : | 49225 | = | 57 | remainder ( 39537 ) | ||||||||||||||||||||||
| 49225 | : | 39537 | = | 1 | remainder ( 9688 ) | ||||||||||||||||||||||
| 39537 | : | 9688 | = | 4 | remainder ( 785 ) | ||||||||||||||||||||||
| 9688 | : | 785 | = | 12 | remainder ( 268 ) | ||||||||||||||||||||||
| 785 | : | 268 | = | 2 | remainder ( 249 ) | ||||||||||||||||||||||
| 268 | : | 249 | = | 1 | remainder ( 19 ) | ||||||||||||||||||||||
| 249 | : | 19 | = | 13 | remainder ( 2 ) | ||||||||||||||||||||||
| 19 | : | 2 | = | 9 | 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.