olymmath

CN-LEAGUE 2013 Problem 4

    Let n,kn,k be integers greater than 11 , n<2kn<2^k . Prove that there exist 2k2k integers none of which are divisible by nn , such that no matter how they are separated into two groups there exist some numbers all from the same group whose sum is divisible by nn .

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