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
Solution Comments
Show comments
Loading...
Problem Recent Solvers42
Suggested Problems
-
Select every other element of a vector
37292 Solvers
-
17471 Solvers
-
Arrange Vector in descending order
14076 Solvers
-
Determine if input is a perfect number
267 Solvers
-
Max Change in Consecutive Elements
184 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!
Thanks to Divid.