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