olymmath

OMCC 2006 Problem 3

  • Day 1

For every natural number nn we define f(n)=⌊n+n+12⌋f(n)=\left\lfloor n+\sqrt{n}+\frac{1}{2}\right\rfloor Show that for every integer k≥1k \geq 1 the equation f(f(n))−f(n)=kf(f(n))-f(n)=k has exactly 2k−12k-1 solutions.

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 centro/2006/p3 · Tag ZFXG7KMS7P · Edit this page on GitHub · Keys: j next, k previous