MathDB
Maximum of sum given two conditions

Source: Chinese TST 1 2012 Day 2 Q1

March 15, 2013
inequalities proposedinequalitiesChina TST

Problem Statement

Let nn and kk be two integers which are greater than 11. Let a1,a2,,an,c1,c2,,cma_1,a_2,\ldots,a_n,c_1,c_2,\ldots,c_m be non-negative real numbers such that i) a1a2ana_1\ge a_2\ge\ldots\ge a_n and a1+a2++an=1a_1+a_2+\ldots+a_n=1; ii) For any integer m{1,2,,n}m\in\{1,2,\ldots,n\}, we have that c1+c2++cmmkc_1+c_2+\ldots+c_m\le m^k. Find the maximum of c1a1k+c2a2k++cnankc_1a_1^k+c_2a_2^k+\ldots+c_na_n^k.