Maths Olympiad Prep

Library / Harvard-MIT Mathematics Tournament /243 of 352

Harvard-MIT Mathematics Tournament

Algebra Difficulty 5.3 AIME, harder Prove it United States

Problem:

Let p(x)=anxn+an−1xn−1+…+a0p(x) = a_n x^n + a_{n-1} x^{n-1} + \ldots + a_0, where each aia_i is either 11 or −1-1. Let rr be a root of pp. If ∣r∣>158|r| > \frac{15}{8}, what is the minimum possible value of nn?

Solution

Solution:

Answer: 44 We claim that n=4n = 4 is the answer. First, we show that n>3n > 3. Suppose that n≤3n \leq 3. Let rr be the root of the polynomial with ∣r∣≥158|r| \geq \frac{15}{8}. Then, by the Triangle Inequality, we have:
∣anrn∣=∣an−1rn−1+an−2rn−2+…+a0∣≤∣an−1rn−1∣+∣an−2rn−2∣+…+∣a0∣∣r∣n≤∣r∣n−1+∣r∣n−2+…+1=∣r∣n−1∣r∣−1∣r∣n+1−2∣r∣n+1≤0⇒1≤∣r∣n(2−∣r∣) \begin{gathered} \left|a_n r^n\right| = \left|a_{n-1} r^{n-1} + a_{n-2} r^{n-2} + \ldots + a_0\right| \leq \left|a_{n-1} r^{n-1}\right| + \left|a_{n-2} r^{n-2}\right| + \ldots + \left|a_0\right| \\ |r|^n \leq |r|^{n-1} + |r|^{n-2} + \ldots + 1 = \frac{|r|^n - 1}{|r| - 1} \\ |r|^{n+1} - 2|r|^n + 1 \leq 0 \Rightarrow 1 \leq |r|^n (2 - |r|) \end{gathered}
The right-hand side is increasing in nn, for ∣r∣>1|r| > 1, so it is bounded by ∣r∣3(2−∣r∣)|r|^3 (2 - |r|). This expression is decreasing in rr for r≥32r \geq \frac{3}{2}. When ∣r∣=158|r| = \frac{15}{8}, then the right-hand side is less than 11, which violates the inequalities. Therefore n>3n > 3. Now, we claim that there is a 44th degree polynomial with a root rr with ∣r∣≥158|r| \geq \frac{15}{8}. Let p(x)=x4−x3−x2−x−1p(x) = x^4 - x^3 - x^2 - x - 1. Then p(158)<0p\left(\frac{15}{8}\right) < 0 and p(2)>2p(2) > 2. By the Intermediate Value Theorem, p(x)p(x) has such a root rr.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.