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
-
"Low : High - Low : High - Turn around " -- Create a subindices vector
527 Solvers
-
230 Solvers
-
5214 Solvers
-
Max Change in Consecutive Elements
151 Solvers
-
generate number in particular way
105 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!