olymmath

KURSCHAK 2020 Problem 3

    There are NN houses in a city. Every Christmas, Santa visits these NN houses in some order. Show that if NN is large enough, then it holds that for three consecutive years there are always are 1313 houses such that they have been visited in the same order for two years (out of the three consecutive years). Determine the smallest NN for which this holds.

    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 kurschak/2020/p3 · Tag A094V6FHTN · Edit this page on GitHub · Keys: j next, k previous