×

Let $$x$$, $$y$$ be coprime positive integers with $$xy > 1$$, and let $$n$$ be an even positive integer. Prove that $$x^n + y^n$$ is not divisible by $$x + y$$.

Note by Finn Hulse
3 years, 2 months ago

Sort by:

Let $$x+y=t$$
Since $$x \equiv -y \mod t$$, we have,
$$x^n+y^n \equiv 2y^n \mod t$$
If the above modulo equals $$0$$, then $$t|2y^n$$ which is clearly impossible since $$t$$ does not divide $$2$$ ($$xy>1 \implies t \ge 3$$) and $$t$$ does not divide $$y^n$$ ($$x$$ and $$y$$ are coprime). · 3 years, 2 months ago

Looks good, but you need to be slightly careful, especially if you haven't used all the conditions in the problem. (Given that it's an olympiad problem, and they tend to be provide just enough details.) If so, think about it. Is that a necessary condition? If yes, then you need to use it. If not, then you might want to explain why the condition isn't needed.

In this case, the statement is true for $$(x,y) = (1,1)$$, which contradicts your claim that we can solutions "only if $$y = 0$$". Staff · 3 years, 2 months ago

@Calvin Lin I guess this should be suffice. · 2 years, 4 months ago

Why would you need Fermat's Last Theorem? What is wrong with a 'remainder-factor-theorem' argument like @Ishan Singh 's? Am I missing something obvious? · 3 years, 2 months ago

I added that just to make you think a little bit. :D · 3 years, 2 months ago

I am pretty sure this is correct.

For any $$x^n + y^n$$, where $$x$$ and $$y$$ are coprime positive integers and $$n$$ is an even positive integer, the equation is irreducible, i.e. it can not be factorised. Hence it has no integer root. But since the question states that $$x$$ and $$y$$ are integers and the sum of two integers is always an integer, $$x^n + y^n$$ is not divisible by $$x + y$$. · 3 years, 2 months ago

Do not confuse a statement about divisibility of polynomials, with a statement about divisibility of integers. Staff · 3 years, 2 months ago