olymmath

ÖMO 2011 Problem 2

  • Day 1

We consider permutations ff of the set N\mathbb{N} of non-negative integers, i.e. bijective maps ff from N\mathbb{N} to N\mathbb{N} , with the following additional properties: f(f(x))=xand∣f(x)−x∣⩽3for all x∈N.f(f(x)) = x \text{and} \left| f(x)-x\right| \leqslant 3 \text{for all } x \in\mathbb{N}\text{.} Further, for all integers n>42n > 42 , M(n)=1n+1∑j=0n∣f(j)−j∣<2,011.\left.M(n)=\frac{1}{n+1}\sum_{j=0}^n \left|f(j)-j\right|<2,011\text{.}\right. Show that there are infinitely many natural numbers KK such that ff maps the set {n∣0⩽n⩽K}\left\{ n\mid 0\leqslant n\leqslant K\right\} onto itself.

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 at-oemo/2011/p2 · Tag HJ3TCVTA89 · Edit this page on GitHub · Keys: j next, k previous