olymmath

IR-TST 2012 Problem 16

  • Test 3

Suppose pp is an odd prime number. We call the polynomial f(x)=∑j=0najxjf(x)=\sum_{j=0}^n a_jx^j with integer coefficients ii -remainder if ∑p−1∣j,j>0aj≡i(modp)\sum_{p-1|j,j>0}a_{j}\equiv i\pmod{p} . Prove that the set {f(0),f(1),...,f(p−1)}\{f(0),f(1),...,f(p-1)\} is a complete residue system modulo pp if and only if polynomials f(x),(f(x))2,...,(f(x))p−2f(x), (f(x))^2,...,(f(x))^{p-2} are 00 -remainder and the polynomial (f(x))p−1(f(x))^{p-1} is 11 -remainder.

Proposed by Yahya Motevassel

Dataset text AI-MO AoPS. Quoted with source.

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 ir-tst/2012/p16 · Tag FG7W4PFEE2 · Edit this page on GitHub · Keys: j next, k previous