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