Let $k \in \mathbb{Z}^+$. Use the Euclidean Algorithm to compute $gcd(7k+14; 3k+6)$.

91 Views Asked by At

I hope the latex above works in the title...

If k is a positive integer, compute gcd(7k+14, 3k+6), using the Euclidean Algorithm.

I'm having some difficulty with the treatment of the variable in this context, and would appreciate some help. Thanks

1

There are 1 best solutions below

3
On BEST ANSWER

Hint: Just use the form $\gcd(a,b)=\gcd(a-b,b)$.

The Euclidean Algorithm is just an abbreviation of this process.