olymmath

TSTST 2011 Problem 8

    Let x0,x1,…,xn0−1x_{0}, x_{1}, \ldots, x_{n_{0}-1} be integers, and let d1,d2,…,dkd_{1}, d_{2}, \ldots, d_{k} be positive integers with n0=d1>d2>⋯>dkn_{0}=d_{1}>d_{2}>\cdots>d_{k} and gcd⁡(d1,d2,…,dk)=1\operatorname{gcd}\left(d_{1}, d_{2}, \ldots, d_{k}\right)=1. For every integer n≥n0n \geq n_{0}, define xn=⌊xn−d1+xn−d2+⋯+xn−dkk⌋.x_{n}=\left\lfloor\frac{x_{n-d_{1}}+x_{n-d_{2}}+\cdots+x_{n-d_{k}}}{k}\right\rfloor . Show that the sequence (xn)\left(x_{n}\right) is eventually constant.

    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 tstst/2011/p8 · Tag PDM0PANY9B · Edit this page on GitHub · Keys: j next, k previous