Problem 54605. minimum numbers of 1 to build n

CXD

40 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

544 Solutions

Last Solution submitted on Dec 07, 2025

Last 200 Solutions

Problem Comments

1 Comment

CXD on 6 May 2022

Thanks to Divid.

Solution Comments

Show comments

Problem Recent Solvers40

Suggested Problems

Create a vector whose elements depend on the previous element

794 Solvers
Reverse the elements of an array

1124 Solvers
Hard limit function

233 Solvers
Find Logic 21

264 Solvers
Square Patterns in a square matrix

21 Solvers

More from this Author12

Find the particular dividend

12 Solvers
Concatenate input positive integers to obtain a maximum.

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

19 Solvers
Complete a 2nd order difference sequence

5 Solvers
perfect square

19 Solvers

Problem Tags

Community Treasure Hunt

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

Start Hunting!