olymmath

OSN 2019 Problem 2

    Given 1919 red boxes and 200200 blue boxes filled with balls. None of which is empty. Suppose that every red boxes have a maximum of 200200 balls and every blue boxes have a maximum of 1919 balls. Suppose that the sum of all balls in the red boxes is less than the sum of all the balls in the blue boxes. Prove that there exists a subset of the red boxes and a subset of the blue boxes such that their sum is the same.

    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 id-osn/2019/p2 · Tag 33YM5WN7WN · Edit this page on GitHub · Keys: j next, k previous