USAMO 1987 Problem 3
- Day 1
is the smallest set of polynomials such that: (1) belongs to ; and (2) if belongs to , then and both belong to . Show that if and are distinct elements of , then for any .
Dataset text NuminaMath olympiads. 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.