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
-
4547 Solvers
-
92 Solvers
-
"Low : High - Low : High - Turn around " -- Create a subindices vector
589 Solvers
-
Create a matrix X, where each column is a shifted copy of the vector v
226 Solvers
-
1948 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 :-)