Problem 52417. Get to a number faster.

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

38.24% Correct | 61.76% Incorrect
Last Solution submitted on Sep 23, 2025

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers13

Suggested Problems

More from this Author1

Problem Tags

mod

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!