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