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

548 Solutions

42 Solvers

Last Solution submitted on Jul 29, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers42

Chris Cleveland George Berken lishuang shuodong

Suggested Problems

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!