AlgebraDifficulty 5.3AIME, harderProve itUnited States
Problem:
Let p(x)=anxn+an−1xn−1+…+a0, where each ai is either 1 or −1. Let r be a root of p. If ∣r∣>815, what is the minimum possible value of n?
Solution
Solution:
Answer: 4 We claim that n=4 is the answer. First, we show that n>3. Suppose that n≤3. Let r be the root of the polynomial with ∣r∣≥815. 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∣−1∣r∣n−1∣r∣n+1−2∣r∣n+1≤0⇒1≤∣r∣n(2−∣r∣) The right-hand side is increasing in n, for ∣r∣>1, so it is bounded by ∣r∣3(2−∣r∣). This expression is decreasing in r for r≥23. When ∣r∣=815, then the right-hand side is less than 1, which violates the inequalities. Therefore n>3. Now, we claim that there is a 4th degree polynomial with a root r with ∣r∣≥815. Let p(x)=x4−x3−x2−x−1. Then p(815)<0 and p(2)>2. By the Intermediate Value Theorem, p(x) has such a root r.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.