TW-TST 2001 Problem 1
Let be a set with at least integers, and let be the maximum element in and the minimum element in . it is known that there exist a polynomial such that: for all in . And also for all in . Prove that and there exist integers and such that is cero in .
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.