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 Solvers24
Suggested Problems
-
Determine if a Given Number is a Triangle Number
398 Solvers
-
Sum all integers from 1 to 2^n
17515 Solvers
-
ベクトル [1 2 3 4 5 6 7 8 9 10] の作成
601 Solvers
-
Let's get back to school, and create multiplication tables
240 Solvers
-
Return fibonacci sequence do not use loop and condition
855 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!
