Putnam 1985 B1
- Session B
Let be the smallest positive integer for which there exist distinct integers such that the polynomial has exactly nonzero coefficients. Find, with proof, a set of integers for which this minimum is achieved.
Curated text Kedlaya Putnam archive. Quoted with source.
Solutions
Human solution Solution 1 by user90184
Clearly ; otherwise and are not distinct. Assume , so with . We can not have since then at least two of the 's are equal to . Hence or with . But and have at most two real zeros. Therefore .
Set , , , , . ThenHence , and this value of is achieved for the given 's.
Mathematics Stack Exchange. Open licence.