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

Sort a list of complex numbers based on far they are from the origin.

5811 Solvers
Pascal's Triangle

4514 Solvers
Magic is simple (for beginners)

11592 Solvers
factorial

11 Solvers
String Logic 14

244 Solvers

More from this Author12

Concatenate input positive integers to obtain a maximum.

44 Solvers
Get twenty-four

3 Solvers
Palindrome Problem 1

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

20 Solvers
prime consecutive sums

9 Solvers

Problem Tags

Community Treasure Hunt

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

Start Hunting!