olymmath

NO-ABEL 1997 Problem 4

    Let p(x)p(x) be a polynomial with integer coefficients. Suppose that there exist different integers aa and bb such that f(a)=bf(a) = b and f(b)=af(b) = a . Show that the equation f(x)=xf(x) = x has at most one integer solution.

    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 no-abel/1997/p4 · Tag 49K8QRNCJX · Edit this page on GitHub · Keys: j next, k previous