olymmath

SIMON-MARAIS 2024 B4

  • Paper B

The following problem is open in the sense that the answer to part (b) is not currently known. A solution to part (a) will be awarded 7 points. Up to 7 additional points may be awarded for progress on part (b).

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) Prove that there exist infinitely many values of nn such that

fn(x,y,z)≡(x+y)(y+z)(z+x)g(x,y,z)h(x,y,z)(mod2),f_n(x, y, z) \equiv (x + y)(y + z)(z + x)g(x, y, z)h(x, y, z) \pmod{2},

for some integer polynomials g(x,y,z)g(x, y, z) and h(x,y,z)h(x, y, z), neither of which is constant modulo 2.

(b) Determine all values of nn such that

fn(x,y,z)≡(x+y)(y+z)(z+x)g(x,y,z)h(x,y,z)(mod2),f_n(x, y, z) \equiv (x + y)(y + z)(z + x)g(x, y, z)h(x, y, z) \pmod{2},

for some integer polynomials g(x,y,z)g(x, y, z) and h(x,y,z)h(x, y, z), neither of which is constant modulo 2.

(Two integer polynomials are congruent modulo 2 if every coefficient of their difference is even. A polynomial is constant modulo 2 if it is congruent to a constant polynomial modulo 2.)

Official text Simon Marais Mathematics Competition 2024 official paper, page 2. Quoted with source.

A model read this text from the scan of the paper by OCR, with vision/local (GLM-OCR-8bit). No person has checked it against the paper yet.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator simon-marais/2024/b4 · Tag AMPCTTECPV · Edit this page on GitHub · Keys: j next, k previous