olymmath

HMMT 2002 A9

  • Algebra

For any positive integer nn, let f(n)f(n) denote the number of 1 's in the base- 2 representation of nn. For how many values of nn with 1≤n≤20021 \leq n \leq 2002 do we have f(n)=f(n+1)f(n)=f(n+1) ?

Dataset text NuminaMath olympiads. 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 hmmt/2002/a9 · Tag Y860QRRPMR · Edit this page on GitHub · Keys: j next, k previous