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