Integer complexity (Large numbers) - MATLAB Cody - MATLAB Central

Problem 42834. Integer complexity (Large numbers)

Difficulty:
(14)
Rate

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.

Solve

Solution Stats

50.0% Correct | 50.0% Incorrect
Last Solution submitted on Mar 22, 2024

Problem Comments

Solution Comments

Show comments
Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025
...
Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers20

Suggested Problems

More from this Author29

Community Treasure Hunt

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

Start Hunting!
Go to top of page