If you start with $1 and, with each move, you can either double your money or add another $1, what is the smallest number of moves you have to make to get to exactly n(number).
Solution Stats
Problem Comments
2 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers16
Suggested Problems
-
666 Solvers
-
Back to basics 2 - Function Path
185 Solvers
-
Sum of diagonal of a square matrix
1645 Solvers
-
Fermat's Last Theorem - Fermat's conjecture
109 Solvers
-
1298 Solvers
More from this Author1
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
The test suite is very weak... :-/
And I am a beginner :-)