Inspired by Problem 42831, this problem aims to calculate the integer complexity for large numbers. The integer complexity of a natural number n is defined as the least number of 1’s required to express n using only the two operations + and × and parentheses.
Example: the number 11 may be represented using 8 ones:
11 = (1 + 1 + 1) × (1 + 1 + 1) + 1 + 1.
However, it has no representation using 7 or fewer ones. Therefore, its complexity is 8.
Your solution will be scored based on its running time. No cheating please.
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers23
Suggested Problems
-
Arrange Vector in descending order
13349 Solvers
-
Convert a vector into a number
615 Solvers
-
Get the elements of diagonal and antidiagonal for any m-by-n matrix
513 Solvers
-
Convert a Cell Array into an Array
2199 Solvers
-
Flip the vector from right to left
10803 Solvers
More from this Author28
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
