benchmarks.wiki / Public workspace

Omni-MATH / Let f:N→N be a function satisfying the following conditions: (a) f(1)=1 (b) f(a)≤f(b) whenever a and b are positive integers with a≤b. (c) f(2a)=f(a)+1 for all positive integers a.…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

Let f:N→Nf: \mathbb{N} \rightarrow \mathbb{N} be a function satisfying the following conditions: (a) f(1)=1f(1)=1 (b) f(a)≤f(b)f(a) \leq f(b) whenever aa and bb are positive integers with a≤ba \leq b. (c) f(2a)=f(a)+1f(2a)=f(a)+1 for all positive integers aa. How many possible values can the 2014-tuple (f(1),f(2),…,f(2014))(f(1), f(2), \ldots, f(2014)) take?
Plain-text mathematical notation (without MathML)
Let f:N→N be a function satisfying the following conditions: (a) f(1)=1 (b) f(a)≤f(b) whenever a and b are positive integers with a≤b. (c) f(2a)=f(a)+1 for all positive integers a. How many possible values can the 2014-tuple (f(1),f(2),…,f(2014)) take?
Original LaTeX notation
Let $f: \mathbb{N} \rightarrow \mathbb{N}$ be a function satisfying the following conditions: (a) $f(1)=1$ (b) $f(a) \leq f(b)$ whenever $a$ and $b$ are positive integers with $a \leq b$. (c) $f(2a)=f(a)+1$ for all positive integers $a$. How many possible values can the 2014-tuple $(f(1), f(2), \ldots, f(2014))$ take?

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import