The GCD of given numbers is 109.
Step 1 :
Divide $ 6831139 $ by $ 30193 $ and get the remainder
The remainder is positive ($ 7521 > 0 $), so we will continue with division.
Step 2 :
Divide $ 30193 $ by $ \color{blue}{ 7521 } $ and get the remainder
The remainder is still positive ($ 109 > 0 $), so we will continue with division.
Step 3 :
Divide $ 7521 $ by $ \color{blue}{ 109 } $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 109 }} $.
We can summarize an algorithm into a following table.
6831139 | : | 30193 | = | 226 | remainder ( 7521 ) | ||||
30193 | : | 7521 | = | 4 | remainder ( 109 ) | ||||
7521 | : | 109 | = | 69 | remainder ( 0 ) | ||||
GCD = 109 |
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.