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