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