olymmath

ISL 2012 A6

Let f:N→Nf: \mathbb{N} \rightarrow \mathbb{N} be a function, and let fmf^{m} be ff applied mm times. Suppose that for every n∈Nn \in \mathbb{N} there exists a k∈Nk \in \mathbb{N} such that f2k(n)=n+kf^{2 k}(n)=n+k, and let knk_{n} be the smallest such kk. Prove that the sequence k1,k2,…k_{1}, k_{2}, \ldots is unbounded.

Official text Transcription from NuminaMath olympiads, checked word for word against the official paper. Quoted with source.

Official text: IMO 2012 Shortlist booklet, page 4.

Solutions

Official solution Solution 1 by the IMO Problem Selection Committee

The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).

Similar problems

These problems have the most words in common with this statement.

Locator isl/2012/a6 · Tag BH27NDXDWN · Edit this page on GitHub · Keys: j next, k previous