olymmath

HMMT 2008 A2

  • Algebra
  • Answer

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?

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

242

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 hmmt/2008/a2 · Tag STMM2T10T1 · Edit this page on GitHub · Keys: j next, k previous