Problem 54605. minimum numbers of 1 to build n

  • Created by CXD
The (Mahler-Popken) complexity of n: minimal number of 1's required to build n using + and *. see A005245.
In this problem, you need to write the expression down, i.e., the return y is a string.
The answer is of course not unique, so just meet the requirement.
Solve

Solution Stats

8.65% Correct | 91.35% Incorrect
Last Solution submitted on Aug 30, 2024

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers32

Suggested Problems

More from this Author12

Problem Tags

expression numbers

Community Treasure Hunt

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

Start Hunting!