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