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