olymmath

RO-TST 1990 Problem 6

    Prove that there are infinitely many n's for which there exists a partition of {1,2,...,3n}\{1,2,...,3n\} into subsets {a1,...,an},{b1,...,bn},{c1,...,cn}\{a_1,...,a_n\}, \{b_1,...,b_n\}, \{c_1,...,c_n\} such that ai+bi=cia_i +b_i = c_i for all ii , and prove that there are infinitely many nn 's for which there is no such partition.

    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 ro-tst/1990/p6 · Tag ZVX1G01R9X · Edit this page on GitHub · Keys: j next, k previous