Let n≥3 be an integer and a1,a2,…,an be real numbers. For each 1≤k≤n the real numbers b1,b2,…,bn+1 are defined by
bk=2ak+max{ak+1,ak+2} and bn+1=b1 (an+1=a1 and an+2=a2). Find the smallest λ such that the inequality λ[i=1∑n(ai−ai+1)2024]≥i=1∑n(bi−bi+1)2024 is held for each n≥3 and all real numbers a1,a2,…,an.
Solution
Answer: λ=22024. Let xi=ai−ai+1. Since for all real numbers max{x,y}=2x+y+2x−y we have bi−bi+1=xi+2xi+1+2xi+2+2xi+1−2xi+2(1)
Let yi=2xi+2xi and zi=2xi−2xi. Then, yi=xi, zi=0 for xi≥0 and yi=0, zi=xi for xi<0. Inserting it to (1) we get (bi−bi+1)2024=(xi+yi+1+zi+2)2024≤22023(xi2024+(yi+1+zi+2)2024)(2) by the Power Mean Inequality. Because yi is always a non-negative real number and zi is always a non-positive real number, we have ∣yi+1+zi+2∣≤∣yi+1∣+∣zi+2∣ which in turn implies that (yi+1+zi+2)2024≤yi+12024+zi+22024
Since yi2024+zi2024=xi2024 for all indices i, by summing the inequalities (2) for all indices i we get the desired inequality. To prove that λ=22024 is the best possible value, consider n=2m and choose the sequence as {ai}={1,2,…,n−1,n,n−1,…,1}. Then, λ has to satisfy the condition λ⋅n≥22024(n−4)+1+1+0+0 for every n. Taking n to infinity, we see that λ should be at least 22024.
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.