olymmath

ISL 1997 Problem 12

    Let pp be a prime number and ff an integer polynomial of degree dd such that f(0)=0,f(1)=1f(0) = 0,f(1) = 1 and f(n)f(n) is congruent to 00 or 11 modulo pp for every integer nn . Prove that d≥p−1d\geq p - 1 .

    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 isl/1997/p12 · Tag 1KQXB92YPH · Edit this page on GitHub · Keys: j next, k previous