MathDB
Polynomial congruence modulo 2

Source: SMMC 2024 B4

October 12, 2024
algebra

Problem Statement

The following problem is open in the sense that the answer to part (b) is not currently known.
Let nn be an odd positive integer and let fn(x,y,z)=xn+yn+zn+(x+y+z)n. f_n(x,y,z) = x^n + y^n + z^n + (x+y+z)^n. (a)(a) Prove that there exist infinitely many values of nn such that fn(x,y,z)(x+y)(y+z)(z+x)gn(x,y,z)hn(x,y,z)(mod2), f_n(x,y,z) \equiv (x+y)(y+z)(z+x) g_n(x,y,z) h_n(x,y,z) \pmod{2}, for some integer polynomials gn(x,y,z)g_n(x,y,z) and hn(x,y,z)h_n(x,y,z), neither of which is constant modulo 2. (b)(b) Determine all values of nn such that fn(x,y,z)(x+y)(y+z)(z+x)gn(x,y,z)hn(x,y,z)(mod2), f_n(x,y,z) \equiv (x+y)(y+z)(z+x) g_n(x,y,z) h_n(x,y,z) \pmod{2}, for some integer polynomials gn(x,y,z)g_n(x,y,z) and hn(x,y,z)h_n(x,y,z), neither of which is constant modulo 2.
(Two integer polynomials are \emph{congruent modulo 2} if every coefficient of their difference is even. A polynomial is \emph{constant modulo 2} if it is congruent to a constant polynomial modulo 2.)