Problem 42831. Integer complexity
Given an array, n, of positive integers, return an array, c, of the same size, in which each element is the complexity of the corresponding element in n.
Integer complexity is defined in number theory as the least number of ones required to represent an integer using only addition, multiplication and parentheses.
Example 1:
n = 3
c = 3
Example 2:
n = [6 10 11;16 18 41]
c = [5 7 8;8 8 12]
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers20
Suggested Problems
-
middleAsColumn: Return all but first and last element as a column vector
594 Solvers
-
Create a matrix X, where each column is a shifted copy of the vector v
192 Solvers
-
699 Solvers
-
Fermat's Last Theorem - Fermat's conjecture
97 Solvers
-
Replace pattern 0 1 0 and 1 0 1
133 Solvers
More from this Author45
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!