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