The GCD of given numbers is 7.
Step 1 :
Divide $ 6999034 $ by $ 699111 $ and get the remainder
The remainder is positive ($ 7924 > 0 $), so we will continue with division.
Step 2 :
Divide $ 699111 $ by $ \color{blue}{ 7924 } $ and get the remainder
The remainder is still positive ($ 1799 > 0 $), so we will continue with division.
Step 3 :
Divide $ 7924 $ by $ \color{blue}{ 1799 } $ and get the remainder
The remainder is still positive ($ 728 > 0 $), so we will continue with division.
Step 4 :
Divide $ 1799 $ by $ \color{blue}{ 728 } $ and get the remainder
The remainder is still positive ($ 343 > 0 $), so we will continue with division.
Step 5 :
Divide $ 728 $ by $ \color{blue}{ 343 } $ and get the remainder
The remainder is still positive ($ 42 > 0 $), so we will continue with division.
Step 6 :
Divide $ 343 $ by $ \color{blue}{ 42 } $ and get the remainder
The remainder is still positive ($ 7 > 0 $), so we will continue with division.
Step 7 :
Divide $ 42 $ by $ \color{blue}{ 7 } $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 7 }} $.
We can summarize an algorithm into a following table.
| 6999034 | : | 699111 | = | 10 | remainder ( 7924 ) | ||||||||||||
| 699111 | : | 7924 | = | 88 | remainder ( 1799 ) | ||||||||||||
| 7924 | : | 1799 | = | 4 | remainder ( 728 ) | ||||||||||||
| 1799 | : | 728 | = | 2 | remainder ( 343 ) | ||||||||||||
| 728 | : | 343 | = | 2 | remainder ( 42 ) | ||||||||||||
| 343 | : | 42 | = | 8 | remainder ( 7 ) | ||||||||||||
| 42 | : | 7 | = | 6 | remainder ( 0 ) | ||||||||||||
| GCD = 7 | |||||||||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.