olymmath

MEMO 2024 T4

    A finite sequence x1,x2,…,xrx_1, x_2, \ldots, x_r of positive integers is a palindrome if xi=xr+1−ix_i = x_{r+1-i} for all integers 1≤i≤r1 \leq i \leq r.

    Let a1,a2,…a_1, a_2, \ldots be an infinite sequence of positive integers. For a positive integer j≥2j \geq 2, denote by a[j]a[j] the finite subsequence a1,a2,…,aj−1a_1, a_2, \ldots, a_{j-1}. Suppose that there exists a strictly increasing infinite sequence b1,b2,…b_1, b_2, \ldots of positive integers such that for every positive integer nn, the subsequence a[bn]a[b_n] is a palindrome and bn+2≤bn+1+bnb_{n+2} \leq b_{n+1} + b_n. Prove that there exists a positive integer TT such that ai=ai+Ta_i = a_{i+T} for every positive integer ii.

    Official text Middle European Mathematical Olympiad 2024 official paper, page 1. Quoted with source.

    A model read this text from the scan of the paper by OCR, with vision/local (GLM-OCR-8bit). No person has checked it against the paper yet.

    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 memo/2024/t4 · Tag QH4VQNPMFT · Edit this page on GitHub · Keys: j next, k previous