1987 USAMO Problems/Problem 3
Problem
is the smallest set of polynomials
such that:
- 1.
belongs to
.
- 2. If
belongs to
, then
and
both belong to
.
Show that if and
are distinct elements of
, then
for any
.
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See Also
1987 USAMO (Problems • Resources) | ||
Preceded by Problem 2 |
Followed by Problem 4 | |
1 • 2 • 3 • 4 • 5 | ||
All USAMO Problems and Solutions |
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions.