Problem 42834. Integer complexity (Large numbers)
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 Solvers20
Suggested Problems
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15599 Solvers
-
4670 Solvers
-
Multiples of a Number in a Given Range
765 Solvers
-
Count letters occurence in text, specific to words with a given length.
169 Solvers
-
Area of an equilateral triangle
6326 Solvers
More from this Author29
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!