Suppose a∈[−2,∞), r∈[0,∞) and let n be a positive integer. Show that r2n+arn+1≥(1−r)2n.
Solution
If r=0, the relation is obvious. Otherwise, dividing by r2n, one gets the same inequality with r replaced by r1, so one can assume r∈(0,1]. Since r2n+arn+1≥r2n−2rn+1=(1−rn)2 and 1−rn≥0, it is enough to prove that 1−rn≥(1−r)n. This follows from rn+(1−r)n≤r+(1−r)=1.
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.