The GCD of given numbers is 2.
Step 1 :
Divide $ 42432 $ by $ 42334 $ and get the remainder
The remainder is positive ($ 98 > 0 $), so we will continue with division.
Step 2 :
Divide $ 42334 $ by $ \color{blue}{ 98 } $ and get the remainder
The remainder is still positive ($ 96 > 0 $), so we will continue with division.
Step 3 :
Divide $ 98 $ by $ \color{blue}{ 96 } $ and get the remainder
The remainder is still positive ($ 2 > 0 $), so we will continue with division.
Step 4 :
Divide $ 96 $ 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.
| 42432 | : | 42334 | = | 1 | remainder ( 98 ) | ||||||
| 42334 | : | 98 | = | 431 | remainder ( 96 ) | ||||||
| 98 | : | 96 | = | 1 | remainder ( 2 ) | ||||||
| 96 | : | 2 | = | 48 | remainder ( 0 ) | ||||||
| GCD = 2 | |||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.