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