For each positive integer n≥2, define the polynomial fn(x) by fn(x)=xn−xn−1−xn−2−⋯−x−1. Prove that (a) for each positive integer n≥2, the equation fn(x)=0 has a unique real positive root, say, αn; (b) (αn)n≥2 is a strictly increasing sequence; and (c) limn→∞αn=2.
Solution
(a) Since fn(x) has one change of sign, it follows that fn(x)=0 has at most one positive real root by Descartes' Rule. As fn(0)=−1<0 and fn(2)=2n−2n−1−2n−2−⋯−2−1=1>0, we see that fn(x)=0 has at least one root between 0 and 2. Thus fn(x)=0 has exactly one root αn between 0 and 2, n≥2.
(b) We show that αn<αn+1, for n≥2. Because fn(αn)=0, we have αnn−αnn−1−αnn−2−⋯−αn−1=0. Now fn+1(αn)=αn(αnn−αnn−1−αnn−2−⋯−αn−1)−1=αn⋅0−1=−1<0. As fn+1(2)=1>0, as above, we infer that there is a root of fn+1(x)=0 between αn and 2. Since αn>0, we conclude that αn<αn+1<2, as desired.
(c) Again (x−1)fn(x)=(x−1)(xn−xn−1−xn−2−⋯−x−1)=xn+1−2xn+1. So αnn+1−2αnn+1=0, giving αn=2−αnn1≥2−α2n1=21+5, where α2=21+5, being the positive root of x2−x−1=0. But α2>1. So α2n1→0, as n→∞. Thus, in 2−α2n1≤αn<2, we let n→∞, to get n→∞limαn=2.
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 and solution reproduced as published; topic and difficulty added by this site.