olymmath

KMO 2012 Problem 2

    There are nn students A1,A2,⋯ ,AnA_1 , A_2 , \cdots , A_n and some of them shaked hands with each other. ( AiA_i and AjA_j can shake hands more than one time.) Let the student AiA_i shaked hands did_i times. Suppose d1+d2+⋯+dn>0d_1 + d_2 + \cdots + d_n > 0 . Prove that there exist 1≤i<j≤n1 \le i < j \le n satisfying the following conditions: (a) Two students AiA_i and AjA_j shaked hands each other. (b) (d1+d2+⋯+dn)2n2≤didj\frac{(d_1 + d_2 + \cdots + d_n ) ^2 }{n^2 } \le d_i d_j

    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 kr-kmo/2012/p2 · Tag 4GJH8FHFAD · Edit this page on GitHub · Keys: j next, k previous