olymmath

ILL 1985 Problem 71

    For every integer r>1r > 1 find the smallest integer h(r)>1h(r) > 1 having the following property: For any partition of the set {1,2,...,h(r)}\{1, 2, . . ., h(r)\} into rr classes, there exist integers a≥0,1≤x≤ya \geq 0, 1 \leq x \leq y such that the numbers a+x,a+y,a+x+ya + x, a + y, a + x + y are contained in the same class of the partition.

    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 ill/1985/p71 · Tag 2QK6HDCK5K · Edit this page on GitHub · Keys: j next, k previous