OMCC 2007 Problem 3
- Day 1
Let be a finite set of integers. Suppose that for every two different elements of , and , there exist not necessarily distinct integers , , belonging to , such that and are the roots of the polynomial . Determine the maximum number of elements that can have.
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.