olymmath

Putnam 1985 B1

  • Session B

Let kk be the smallest positive integer for which there exist distinct integers m1,m2,m3,m4,m5m_1, m_2, m_3, m_4, m_5 such that the polynomial p(x)=(x−m1)(x−m2)(x−m3)(x−m4)(x−m5)p(x) = (x-m_1)(x-m_2)(x-m_3)(x-m_4)(x-m_5) has exactly kk nonzero coefficients. Find, with proof, a set of integers m1,m2,m3,m4,m5m_1, m_2, m_3, m_4, m_5 for which this minimum kk is achieved.

Curated text Kedlaya Putnam archive. Quoted with source.

Solutions

Human solution Solution 1 by user90184

Clearly k>1k > 1; otherwise p(x)=x5p(x) = x^5 and m1,…,m5m_1, \ldots, m_5 are not distinct. Assume k=2k = 2, so p(x)=x5+axjp(x) = x^5 + ax^j with 0≤j≤40 \le j \le 4. We can not have j≥2j \ge 2 since then at least two of the mlm_l's are equal to 00. Hence p(x)=x5+ap(x) = x^5 + a or p(x)=x(x4+a)p(x) = x(x^4 + a) with a≠0a \neq 0. But x5+ax^5 + a and x4+ax^4 + a have at most two real zeros. Therefore k≥3k \ge 3.

Set m1=−2m_1 = -2, m2=−1m_2 = -1, m3=0m_3 = 0, m4=1m_4 = 1, m5=2m_5 = 2. Thenp(x)=x(x2−1)(x2−4)=x5−5x3+4x.p(x) = x(x^2 - 1)(x^2 - 4) = x^5 - 5x^3 + 4x.Hence k=3k = 3, and this value of kk is achieved for the given mlm_l's.

Mathematics Stack Exchange. Open licence.

Locator putnam/1985/b1 · Tag F5HH9B840R · Edit this page on GitHub · Keys: j next, k previous