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 Solvers21
Suggested Problems
-
Convert a numerical matrix into a cell array of strings
2183 Solvers
-
Set the array elements whose value is 13 to 0
1395 Solvers
-
Let's get back to school, and create multiplication tables
218 Solvers
-
Back to basics - mean of corner elements of a matrix
437 Solvers
-
Convert integer to base26 using letters
45 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!