benchmarks.wiki / Public workspace

Omni-MATH / Determine all integers k≥1 with the following property: given k different colours, if each integer is coloured in one of these k colours, then there must exist integers …

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

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,\dots,a_{2023}-a_{2022} are all powers of 22.
Plain-text mathematical notation (without MathML)
Determine all integers k≥1 with the following property: given k different colours, if each integer is coloured in one of these k colours, then there must exist integers a₁<a₂<⋯<a₂₀₂₃ of the same colour such that the differences a₂−a₁,a₃−a₂,…,a₂₀₂₃−a₂₀₂₂ are all powers of 2.
Original LaTeX notation
Determine all integers $k\geqslant 1$ with the following property: given $k$ different colours, if each integer is coloured in one of these $k$ colours, then there must exist integers $a_1<a_2<\cdots<a_{2023}$ of the same colour such that the differences $a_2-a_1,a_3-a_2,\dots,a_{2023}-a_{2022}$ are all powers of $2$.

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import