Problem 54605. minimum numbers of 1 to build n

CXD

41 solvers

2 likes

Solve

Solve Later

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

545 Solutions

Last Solution submitted on Jun 01, 2026

Last 200 Solutions

Problem Comments

1 Comment

CXD on 6 May 2022

Thanks to Divid.

Solution Comments

Show comments

Problem Recent Solvers41

Suggested Problems

Determine if input is odd

22564 Solvers
What is the distance from point P(x,y) to the line Ax + By + C = 0?

560 Solvers
How to add?

160 Solvers
Is this triangle right-angled?

6615 Solvers
Convert array of decimal numbers into binary numbers array.

59 Solvers

More from this Author12

Palindrome Problem 1

17 Solvers
n-th digit of write-down all numbers

21 Solvers
increasing sequences

10 Solvers
prime consecutive sums

9 Solvers
switch base

8 Solvers

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!