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) … · Discussion

Discussing 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) … · Omni-MATH

Posts

Chronological order within this page.

Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.