Problem 54605. minimum numbers of 1 to build n
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.
Solution Stats
Problem Comments
-
1 Comment
CXD
on 6 May 2022
Thanks to Divid.
Solution Comments
Show commentsProblem Recent Solvers17
Suggested Problems
-
13047 Solvers
-
948 Solvers
-
262 Solvers
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1035 Solvers
-
8246 Solvers
More from this Author10
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!