# Show that $\mathrm{gcd}(x+4,x-4)$ divides $8$ for all integers $x$.

I want to prove that $\mathrm{gcd}(x-4,x+4)$ divides $8$ for all $x\in \mathbb{Z}$

Since they are both polynomials of degree $1$, it suggests that the $\mathrm{gcd}$ is a constant.

Using Euclidean Algorithm, I get: $(x+4) = 1(x-4) + 8$, so $\mathrm{gcd}(x-4,x+4)=\mathrm{gcd}(x-4,8)$ thus it will always divide $8$.

Is this the correct approach / use of EA for polynomials?

Thanks.

• Yes, but for integers, not polynomials. See here for more. – Bill Dubuque Jan 30 '15 at 18:00
• Ah okay. So this approach works solely because I am evaluating x-4 and x+4 at some integer x, so it is essentially just using EA for integers? – lifin Jan 30 '15 at 18:07
• The gcd is not a gcd of polynomials, but integers, e.g. $\,\gcd(x,2) = 1\,$ in $\,\Bbb Z[x]\,$ but the gcd $= 2$ if $\,x\,$ is an even integer. You can deduce some integer information from polynomial gcds, but there is no need to even consider polynomials here - just work with integers, i.e. use $\,\gcd(a,b) = \gcd(a\!-\!b,b)\,$ for all integers $\,a,b.\ \$ – Bill Dubuque Jan 30 '15 at 18:13

Your approach is correct. Another way of proving it is the following: $$d\mid x-4\text{ and }d\mid x+4\implies d\mid(x+4)-(x-4)=8.$$
• Actually, I went with $d|(x+4)-(x-4) \Rightarrow d|8$. Is that what you meant to write? – lifin Jan 30 '15 at 17:52