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
-
Make the vector [1 2 3 4 5 6 7 8 9 10]
53945 Solvers
-
2826 Solvers
-
Project Euler: Problem 3, Largest prime factor
1831 Solvers
-
238 Solvers
-
334 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 :-)