The GCD of given numbers is 11.
Step 1 :
Divide $ 949509 $ by $ 74569 $ and get the remainder
The remainder is positive ($ 54681 > 0 $), so we will continue with division.
Step 2 :
Divide $ 74569 $ by $ \color{blue}{ 54681 } $ and get the remainder
The remainder is still positive ($ 19888 > 0 $), so we will continue with division.
Step 3 :
Divide $ 54681 $ by $ \color{blue}{ 19888 } $ and get the remainder
The remainder is still positive ($ 14905 > 0 $), so we will continue with division.
Step 4 :
Divide $ 19888 $ by $ \color{blue}{ 14905 } $ and get the remainder
The remainder is still positive ($ 4983 > 0 $), so we will continue with division.
Step 5 :
Divide $ 14905 $ by $ \color{blue}{ 4983 } $ and get the remainder
The remainder is still positive ($ 4939 > 0 $), so we will continue with division.
Step 6 :
Divide $ 4983 $ by $ \color{blue}{ 4939 } $ and get the remainder
The remainder is still positive ($ 44 > 0 $), so we will continue with division.
Step 7 :
Divide $ 4939 $ by $ \color{blue}{ 44 } $ and get the remainder
The remainder is still positive ($ 11 > 0 $), so we will continue with division.
Step 8 :
Divide $ 44 $ by $ \color{blue}{ 11 } $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 11 }} $.
We can summarize an algorithm into a following table.
| 949509 | : | 74569 | = | 12 | remainder ( 54681 ) | ||||||||||||||
| 74569 | : | 54681 | = | 1 | remainder ( 19888 ) | ||||||||||||||
| 54681 | : | 19888 | = | 2 | remainder ( 14905 ) | ||||||||||||||
| 19888 | : | 14905 | = | 1 | remainder ( 4983 ) | ||||||||||||||
| 14905 | : | 4983 | = | 2 | remainder ( 4939 ) | ||||||||||||||
| 4983 | : | 4939 | = | 1 | remainder ( 44 ) | ||||||||||||||
| 4939 | : | 44 | = | 112 | remainder ( 11 ) | ||||||||||||||
| 44 | : | 11 | = | 4 | remainder ( 0 ) | ||||||||||||||
| GCD = 11 | |||||||||||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.