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