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
-
1917 Solvers
-
Find the largest value in the 3D matrix
1695 Solvers
-
Lychrel Number Test (Inspired by Project Euler Problem 55)
119 Solvers
-
The Answer to Life, the Universe, and Everything
588 Solvers
-
1082 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 :-)