The GCD of given numbers is 7.
Step 1 :
Divide $ 385 $ by $ 84 $ and get the remainder
The remainder is positive ($ 49 > 0 $), so we will continue with division.
Step 2 :
Divide $ 84 $ by $ \color{blue}{ 49 } $ and get the remainder
The remainder is still positive ($ 35 > 0 $), so we will continue with division.
Step 3 :
Divide $ 49 $ by $ \color{blue}{ 35 } $ and get the remainder
The remainder is still positive ($ 14 > 0 $), so we will continue with division.
Step 4 :
Divide $ 35 $ by $ \color{blue}{ 14 } $ and get the remainder
The remainder is still positive ($ 7 > 0 $), so we will continue with division.
Step 5 :
Divide $ 14 $ 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.
| 385 | : | 84 | = | 4 | remainder ( 49 ) | ||||||||
| 84 | : | 49 | = | 1 | remainder ( 35 ) | ||||||||
| 49 | : | 35 | = | 1 | remainder ( 14 ) | ||||||||
| 35 | : | 14 | = | 2 | remainder ( 7 ) | ||||||||
| 14 | : | 7 | = | 2 | remainder ( 0 ) | ||||||||
| GCD = 7 | |||||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.