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