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