This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
p=[2];
N=8;
y_correct=256;
assert(isequal(polypow(p,N),y_correct))
|
2 | Pass |
p=[1 1];
N=1;
y_correct=[1 1];
assert(isequal(polypow(p,N),y_correct))
|
3 | Pass |
p=[1 1];
N=5;
y_correct=[1 5 10 10 5 1];
assert(isequal(polypow(p,N),y_correct))
|
4 | Pass |
p=1:5;
N=3;
y_correct=[1 6 21 56 126 234 369 504 594 574 465 300 125];
assert(isequal(polypow(p,N),y_correct))
|
5 | Pass |
p=5:-1:1;
N=3;
y_correct=[125 300 465 574 594 504 369 234 126 56 21 6 1];
assert(isequal(polypow(p,N),y_correct))
|
6 | Pass |
p=5:-1:1;
N=1;
y_correct=[5 4 3 2 1];
assert(isequal(polypow(p,N),y_correct))
|
Sum all integers from 1 to 2^n
8419 Solvers
755 Solvers
613 Solvers
387 Solvers
463 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!