The GCD of given numbers is 14.
Step 1 :
Divide $ 2352 $ by $ 1442 $ and get the remainder
The remainder is positive ($ 910 > 0 $), so we will continue with division.
Step 2 :
Divide $ 1442 $ by $ \color{blue}{ 910 } $ and get the remainder
The remainder is still positive ($ 532 > 0 $), so we will continue with division.
Step 3 :
Divide $ 910 $ by $ \color{blue}{ 532 } $ and get the remainder
The remainder is still positive ($ 378 > 0 $), so we will continue with division.
Step 4 :
Divide $ 532 $ by $ \color{blue}{ 378 } $ and get the remainder
The remainder is still positive ($ 154 > 0 $), so we will continue with division.
Step 5 :
Divide $ 378 $ by $ \color{blue}{ 154 } $ and get the remainder
The remainder is still positive ($ 70 > 0 $), so we will continue with division.
Step 6 :
Divide $ 154 $ by $ \color{blue}{ 70 } $ and get the remainder
The remainder is still positive ($ 14 > 0 $), so we will continue with division.
Step 7 :
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.
| 2352 | : | 1442 | = | 1 | remainder ( 910 ) | ||||||||||||
| 1442 | : | 910 | = | 1 | remainder ( 532 ) | ||||||||||||
| 910 | : | 532 | = | 1 | remainder ( 378 ) | ||||||||||||
| 532 | : | 378 | = | 1 | remainder ( 154 ) | ||||||||||||
| 378 | : | 154 | = | 2 | remainder ( 70 ) | ||||||||||||
| 154 | : | 70 | = | 2 | 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.