2006 USAMO Problems/Problem 5
(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 , then it can jump either to or to where is the largest power of 2 that is a factor of k\ge 2i2^i k2^i$.
This problem needs a solution. If you have a solution for it, please help us out by.
- <url>viewtopic.php?t=84558 Discussion on AoPS/MathLinks</url>
|2006 USAMO (Problems • Resources)|
|1 • 2 • 3 • 4 • 5 • 6|
|All USAMO Problems and Solutions|