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