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 Solvers21
Suggested Problems
-
Find the sum of all the numbers of the input vector
47707 Solvers
-
995 Solvers
-
5356 Solvers
-
Find the sides of an isosceles triangle when given its area and height from its base to apex
1843 Solvers
-
10 Solvers
More from this Author12
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!