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 Solvers14
Suggested Problems
-
Back to basics 23 - Triangular matrix
1137 Solvers
-
Replace all zeros and NaNs in a matrix with the string 'error'
104 Solvers
-
563 Solvers
-
Magic is simple (for beginners)
11582 Solvers
-
715 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 :-)