Create the convolution-power vector from initial vector x and power n. In other words, similar to the scalar case, raising to the n-th power means repeating the convolution on itself n times.
Assume that n is a non-negative integer and x is a row vector.
Examples:
convpower(1:5,0)
ans =
1 convpower(1:5,1)
ans =
1 2 3 4 5 convpower(1:5,2)
ans =
1 4 10 20 35 44 46 40 25Neither string operations nor interpolations are allowed!
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers54
Suggested Problems
-
1718 Solvers
-
Given an unsigned integer x, find the largest y by rearranging the bits in x
2081 Solvers
-
399 Solvers
-
375 Solvers
-
139 Solvers
More from this Author18
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Unfortunately the FFT based solution using a binary expansion of 'n' won't be Cody-optimal :-)