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 Solvers15
Suggested Problems
-
Find the numeric mean of the prime numbers in a matrix.
9160 Solvers
-
2016 Solvers
-
Change the sign of even index entries of the reversed vector
660 Solvers
-
Detect a number and replace with two NaN's
200 Solvers
-
89 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 :-)