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