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