olymmath

NL-BXMO-TST 2018 Problem 1

    We have 10001000 balls in 4040 different colours, 2525 balls of each colour. Determine the smallest nn for which the following holds: if you place the 10001000 balls in a circle, in any arbitrary way, then there are always nn adjacent balls which have at least 2020 different colours.

    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 nl-bxmo-tst/2018/p1 · Tag CA3P065GE6 · Edit this page on GitHub · Keys: j next, k previous