Let $x,y,z$ be integers and $p$ an odd integer.How can I prove that $$\sum_{i+j+k=p}{p\choose i+j+k}x^iy^jz^k\equiv x^p+y^p+z^p\pmod{(x+y)(y+z)(z+x)}$$
Asked
Active
Viewed 29 times
1 Answers
1
We have to prove that the polynomial $f=(x+y)(x+z)(y+z)$ divides the polynomial $g=(x+y+z)^p-(x^p+y^p+z^p).$ It is enouth to show that all roots of $f$ are roots and for $g.$ Take, for example, a root $x=-y$ and put into $g$. We get $z^p-( (-y)^p+y^p+z^p)=0$ for odd $p$. Thus $g=(x+y)g_1$ for some polynomial $g_1.$ In a similar way working with $x=-z$ and $y=-z$ we get that $g=0 \mod (x+y)(x+z)(y+z).$
Leox
- 8,120
-
Thanks for input. Would you happen to figure out what the summation expression of that polynomial of degree n-3 is? – Feb 11 '17 at 13:36
-
-
-
I can choose any n and wolfram will do the rest. But I wanna know what the general expression is like. – Feb 11 '17 at 13:45
-
-
-
-
-
-
suppose that p=5, f(x,y,z)= 5(x^2+y^2+z^2+ xy+ yz+zx). What is the summation notation of that expression? – Feb 11 '17 at 14:15
-
$$(x+y+z)^p-(x^p+y^p+z^p)=f(x,y,z)(x+y)(y+z)(z+x)$$ I would like to know the summation notation of $f(x,y,z)$. I hope this is much clearer. Let me give you your due credit and ask another question. Thanks. – Feb 11 '17 at 14:19