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
-
Sort a list of complex numbers based on far they are from the origin.
5820 Solvers
-
Find the peak 3n+1 sequence value
2572 Solvers
-
Project Euler: Problem 6, Natural numbers, squares and sums.
2586 Solvers
-
Set the array elements whose value is 13 to 0
1459 Solvers
-
Check if number exists in vector
14531 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.