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