MathDB
There exists a finite sequence a_i for all sequences c_i

Source: IMO LongList 1982 - P48

May 16, 2011
inequalitiesinductioncomplex numberscombinatorial geometryalgebra unsolvedalgebra

Problem Statement

Given a finite sequence of complex numbers c1,c2,,cnc_1, c_2, \ldots , c_n, show that there exists an integer kk (1kn1 \leq k \leq n) such that for every finite sequence a1,a2,,ana_1, a_2, \ldots, a_n of real numbers with 1a1a2an01 \geq a_1 \geq a_2 \geq \cdots \geq a_n \geq 0, the following inequality holds: m=1namcmm=1kcm.\left| \sum_{m=1}^n a_mc_m \right| \leq \left| \sum_{m=1}^k c_m \right|.