olymmath

IN-TST 2003 Problem 9

    Let nn be a positive integer and {A,B,C}\{A,B,C\} a partition of {1,2,…,3n}\{1,2,\ldots,3n\} such that ∣A∣=∣B∣=∣C∣=n|A|=|B|=|C|=n . Prove that there exist x∈Ax \in A , y∈By \in B , z∈Cz \in C such that one of x,y,zx,y,z is the sum of the other two.

    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 in-tst/2003/p9 · Tag 3NMDCRSVKA · Edit this page on GitHub · Keys: j next, k previous