olymmath

KöMaL 2026 A940

    Let pp be a prime number and let kk be an integer with 1≤k≤p1\le k\le p. Suppose that f(x)f(x) is a polynomial with integer coefficients such that its value at every integer point gives a remainder of 00 or 11 when divided by pkp^k, and both cases occur. Show that the degree of ff is at least k(p−1)k(p-1).

    Official text KöMaL. 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 hu-komal/2026/a940 · Tag J78G36XEF1 · Edit this page on GitHub · Keys: j next, k previous