olymmath

SILK-ROAD 2002 Problem 2

    I tried to search SRMC problems,but i didn't find them(I found only SRMC 2006).Maybe someone know where on this site i could find SRMC problems?I have all SRMC problems,if someone want i could post them, :wink: Here is one of them,this is one nice inequality from first SRMC: Let nn be an integer with n>2n>2 and a1,a2,…,an∈R+a_{1},a_{2},\dots,a_{n}\in R^{+} .Given any positive integers t,k,pt,k,p with 1<t<n1<t<n ,set m=k+pm=k+p ,prove the following inequalities: a) a1pa2k+a3k+⋯+atk+a2pa3k+a4k+⋯+at+1k+⋯+an−1pank+a1k+⋯+at−2k+anpa1k+a2k+⋯+at−1k≥(a1p+a2p⋯+anp)2(t−1)(a1m+a2m+⋯+anm)\frac{a_{1}^{p}}{a_{2}^{k}+a_{3}^{k}+\dots+a_{t}^{k}}+\frac{a_{2}^{p}}{a_{3}^{k}+a_{4}^{k}+\dots+a_{t+1}^{k}}+\dots+\frac{a_{n-1}^{p}}{a_{n}^{k}+a_{1}^{k}+\dots+a_{t-2}^{k}}+\frac{a_{n}^{p}}{a_{1}^{k}+a_{2}^{k}+\dots+a_{t-1}^{k}}\geq\frac{(a_{1}^{p}+a_{2}^{p}\dots+a_{n}^{p})^{2}}{(t-1) ( a_{1}^{m}+a_{2}^{m}+\dots+a_{n}^{m})} b) a2k+a3k⋯+atka1p+a3k+a4k⋯+at+1ka2p+⋯+a1k+a2k⋯+at−1kanp≥(t−1)(a1k+a2k⋯+ank)2(a1m+a2m+⋯+anm)\frac{a_{2}^{k}+a_{3}^{k}\dots+a_{t}^{k}}{a_{1}^{p}}+\frac{a_{3}^{k}+a_{4}^{k}\dots+a_{t+1}^{k}}{a_{2}^{p}}+\dots+\frac{a_{1}^{k}+a_{2}^{k}\dots+a_{t-1}^{k}}{a_{n}^{p}}\geq\frac{(t-1)(a_{1}^{k}+a_{2}^{k}\dots+a_{n}^{k})^{2}}{( a_{1}^{m}+a_{2}^{m}+\dots+a_{n}^{m})} :wink:

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator silk-road/2002/p2 · Tag J3PJ3Z7EC0 · Edit this page on GitHub · Keys: j next, k previous