olymmath

BxMO 2023 Problem 2

    Determine all integers k⩾1k \geqslant 1 with the following property: given kk different colours, if each integer is coloured in one of these kk colours, then there must exist integers a1<a2<⋯<a2023a_{1}<a_{2}<\cdots<a_{2023} of the same colour such that the differences a2−a1,a3−a2,…,a2023−a2022a_{2}-a_{1}, a_{3}-a_{2}, \ldots, a_{2023}-a_{2022} are all powers of 2 .

    Dataset text NuminaMath olympiads. 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

    Locator benelux/2023/p2 · Tag JRG90D5SH6 · Edit this page on GitHub · Keys: j next, k previous