ELMO SL 2011 A6
Let be a polynomial with integer coefficients. Prove that there exists a polynomial with integer coefficients such that for every integer , where denotes the number of derangements (permutations with no fixed points) of .
Calvin Deng.
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.
Similar problems
These problems have the most words in common with this statement.