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