olymmath

APMO 2008 Problem 4

  • Paper
  • Answer

Consider the function f:N0→N0f: \mathbb{N}_{0} \rightarrow \mathbb{N}_{0}, where N0\mathbb{N}_{0} is the set of all non-negative integers, defined by the following conditions: (i) f(0)=0f(0)=0, (ii) f(2n)=2f(n)f(2 n)=2 f(n) and (iii) f(2n+1)=n+2f(n)f(2 n+1)=n+2 f(n) for all n≥0n \geq 0. (a) Determine the three sets L:={n∣f(n)<f(n+1)},E:={n∣f(n)=f(n+1)}L:=\{n \mid f(n)<f(n+1)\}, E:=\{n \mid f(n)=f(n+1)\}, and G:={n∣f(n)>f(n+1)}G:=\{n \mid f(n)>f(n+1)\}. (b) For each k≥0k \geq 0, find a formula for ak:=max⁡{f(n):0≤n≤2k}a_{k}:=\max \left\{f(n): 0 \leq n \leq 2^{k}\right\} in terms of kk.

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

a_{k} = k 2^{k-1} - 2^{k} + 1

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 apmo/2008/p4 · Tag 5KAA7GE8KW · Edit this page on GitHub · Keys: j next, k previous