Let a1,a2,…,an be nonnegative real numbers such that for every positive integer 1≤k≤n, a1a2⋯ak≥(2k)!1 Prove that: a1+a2+⋯+an≥n+11+n+21+⋯+2n1.
Solution
We rewrite the left-hand side of the problem as follows: a1+a2+⋯+an=(1−21)(1⋅2a1)+(31−41)(3⋅4a2)+⋯+(2n−11−2n1)((2n−1)⋅2nan)=(1−21−31+41)(1⋅2a1)+(31−41−51+61)(1⋅2a1+3⋅4a2)+⋯+(2n−11−2n1)(1⋅2a1+3⋅4a2+⋯+(2n−1)⋅2nan). By the AM-GM inequality and the condition of the problem, we have: 1⋅2a1≥1,1⋅2a1+3⋅4a2≥2,⋯,1⋅2a1+3⋅4a2+⋯+(2n−1)2nan≥n. Hence a1+a2+⋯+an≥(1−21−31+41)+2(31−41−51+61)+⋯+n(2n−11−2n1)=1−21+31−41+51−61+⋯+2n−11−2n1=1+21+31+41+51+⋯+2n−11+2n1−2(21+41+61+⋯+2n1)=n+11+n+21+⋯+2n1.
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 translated into English from the original; metadata (topic, difficulty) added by this project.