olymmath

KMO 2010 Problem 4

    There are n(≥4)n ( \ge 4 ) people and some people shaked hands each other. Two people can shake hands at most 1 time. For arbitrary four people A,B,C,DA, B, C, D such that (A,B),(B,C),(C,D)(A,B), (B,C), (C,D) shaked hands, then one of (A,C),(A,D),(B,D)(A,C), (A,D), (B,D) shaked hand each other. Prove the following statements. (a) Prove that nn people can be divided into two groups, X,Y(≠∅)X, Y ( \ne \emptyset ) , such that for all (x,y)(x,y) where x∈Xx \in X and y∈Yy \in Y , xx and yy shaked hands or xx and yy didn't shake hands. (b) There exist two people A,BA , B such that the set of people who are not AA and BB that shaked hands with AA is same wiith the set of people who are not AA and BB that shaked hands with BB .

    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/2010/p4 · Tag WC33CAN6HW · Edit this page on GitHub · Keys: j next, k previous