OME 2006 Problem 1
Let be a polynomial with integer coefficients. Prove that if there is an integer such that none of the integers is divisible by , then does not have integer roots.
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.