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
-
How long is the longest prime diagonal?
414 Solvers
-
368 Solvers
-
Unique values without using UNIQUE function
457 Solvers
-
Sum the elements in either diagonal of a square matrix
223 Solvers
-
Numbers spiral diagonals (Part 1)
312 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 :-)