2006 USAMO Problems/Problem 5

Revision as of 03:12, 6 August 2014 by 5849206328x (talk | contribs)


(Zoran Sunik) A mathematical frog jumps along the number line. The frog starts at 1, and jumps according to the following rule: if the frog is at integer $n$, then it can jump either to $n+1$ or to $n+2^{m_n+1}$ where $2^{m_n}$ is the largest power of 2 that is a factor of $n . Show that if$k\ge 2$is a positive integer and$i$is a nonnegative integer, then the minimum number of jumps needed to reach$2^i k$is greater than the minimum number of jumps needed to reach$2^i$.


This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also

  • <url>viewtopic.php?t=84558 Discussion on AoPS/MathLinks</url>
2006 USAMO (ProblemsResources)
Preceded by
Problem 4
Followed by
Problem 6
1 2 3 4 5 6
All USAMO Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Invalid username
Login to AoPS