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