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