olymmath

TR-MO 2000 Problem 4

    Let pp be a prime number. T(x)T(x) is a polynomial with integer coefficients and degree from the set {0,1,...,p−1}\{0,1,...,p-1\} and such that T(n)≡T(m)(modp)T(n) \equiv T(m) (mod p) for some integers m and n implies that m≡n(modp)m \equiv n (mod p) . Determine the maximum possible value of degree of T(x)T(x)

    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 tr-mo/2000/p4 · Tag Y9W4M75KZH · Edit this page on GitHub · Keys: j next, k previous