benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Let f(n) be the number of times you have to hit the √() key on a calculator to get a number less than 2 starting from n. For instance, f(2)=1,f(5)=2. For how many 1<m<2008 is f(m) …

Problem

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

problem

Let f(n)f(n) be the number of times you have to hit the \sqrt{ } key on a calculator to get a number less than 2 starting from nn. For instance, f(2)=1,f(5)=2f(2)=1, f(5)=2. For how many 1<m<20081<m<2008 is f(m)f(m) odd?
Plain-text mathematical notation (without MathML)
Let f(n) be the number of times you have to hit the √() key on a calculator to get a number less than 2 starting from n. For instance, f(2)=1,f(5)=2. For how many 1<m<2008 is f(m) odd?
Original LaTeX notation
Let $f(n)$ be the number of times you have to hit the $\sqrt{ }$ key on a calculator to get a number less than 2 starting from $n$. For instance, $f(2)=1, f(5)=2$. For how many $1<m<2008$ is $f(m)$ odd?

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

task_id
63b8f2b3-35c6-5973-ab44-c9fe99652e9d
task_key
test--63b8f2b3-35c6-5973-ab44-c9fe99652e9d
task_revision_id
1
config / split
/ test

Official source

initial import