olymmath

KURSCHAK 2004 Problem 2

    Find the smallest positive integer n≠2004n\neq 2004 for which there exists a polynomial f∈Z[x]f\in\mathbb{Z}[x] such that the equation f(x)=2004f(x)=2004 has at least one, and the equation f(x)=nf(x)=n has at least 20042004 different integer solutions.

    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 kurschak/2004/p2 · Tag B7PC1M6VAS · Edit this page on GitHub · Keys: j next, k previous