Let's denote \(p(x) = x^{n}+y^{n}\). Due to remainder theorem (little Bezout's theorem) remainder will be \(p(-y)= (-y) ^{n} + y^{n}=0\), because n is odd. Therefore the remainder is 0, so p(x) is divisible by x+y.
–
Karan Pedja
·
2 years, 1 month ago

Log in to reply

Hi,@Ayush Choubey
If n is odd, then \[x^{n}+y^{n}=(x+y)(x^{n-1}-x^{n-2}y+x^{n-3}y^{2}-....+y^{n-1}) \]
which can be proved easily by expanding or using induction.
–
Abhijeet Verma
·
1 year, 4 months ago

## Comments

Sort by:

TopNewestLet's denote \(p(x) = x^{n}+y^{n}\). Due to remainder theorem (little Bezout's theorem) remainder will be \(p(-y)= (-y) ^{n} + y^{n}=0\), because n is odd. Therefore the remainder is 0, so p(x) is divisible by x+y. – Karan Pedja · 2 years, 1 month ago

Log in to reply

Hi,@Ayush Choubey If n is odd, then \[x^{n}+y^{n}=(x+y)(x^{n-1}-x^{n-2}y+x^{n-3}y^{2}-....+y^{n-1}) \] which can be proved easily by expanding or using induction. – Abhijeet Verma · 1 year, 4 months ago

Log in to reply