The GCD of given numbers is 578.
Step 1 :
Divide $ 11033442 $ by $ 1102246 $ and get the remainder
The remainder is positive ($ 10982 > 0 $), so we will continue with division.
Step 2 :
Divide $ 1102246 $ by $ \color{blue}{ 10982 } $ and get the remainder
The remainder is still positive ($ 4046 > 0 $), so we will continue with division.
Step 3 :
Divide $ 10982 $ by $ \color{blue}{ 4046 } $ and get the remainder
The remainder is still positive ($ 2890 > 0 $), so we will continue with division.
Step 4 :
Divide $ 4046 $ by $ \color{blue}{ 2890 } $ and get the remainder
The remainder is still positive ($ 1156 > 0 $), so we will continue with division.
Step 5 :
Divide $ 2890 $ by $ \color{blue}{ 1156 } $ and get the remainder
The remainder is still positive ($ 578 > 0 $), so we will continue with division.
Step 6 :
Divide $ 1156 $ by $ \color{blue}{ 578 } $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 578 }} $.
We can summarize an algorithm into a following table.
| 11033442 | : | 1102246 | = | 10 | remainder ( 10982 ) | ||||||||||
| 1102246 | : | 10982 | = | 100 | remainder ( 4046 ) | ||||||||||
| 10982 | : | 4046 | = | 2 | remainder ( 2890 ) | ||||||||||
| 4046 | : | 2890 | = | 1 | remainder ( 1156 ) | ||||||||||
| 2890 | : | 1156 | = | 2 | remainder ( 578 ) | ||||||||||
| 1156 | : | 578 | = | 2 | remainder ( 0 ) | ||||||||||
| GCD = 578 | |||||||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.