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