olymmath

KöMaL 2018 B4974

    At least how many numbers should be selected out of 1,2,…,101, 2,\ldots, 10 so that we can be certain that every such selection will contain a set of numbers whose sum is divisible by 11?

    Official text KöMaL. 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 hu-komal/2018/b4974 · Tag NT3RDNXR2Q · Edit this page on GitHub · Keys: j next, k previous