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).
Solve

Solution Stats

35 Solutions

14 Solvers

Last Solution submitted on May 31, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers14

Binbin Qi Chris Cleveland Christian Schröder Alexander Ross

Suggested Problems

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!