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