Cody

Problem 1771. Polygonal numbers

Solution 1280971

Submitted on 4 Oct 2017 by Andrew Dobrovolc
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
assert(P(4,3)==9)

y = 9

2   Pass
s=3; n=1:5; y_correct=[1 3 6 10 15]; assert(isequal(P(s,n),y_correct))

y = 1 3 6 10 15

3   Pass
s=3:6; n=4; Y_correct=[10 16 22 28]; assert(isequal(P(s,n),Y_correct))

y = 10 16 22 28

4   Pass
s=randi([3 1000],1,10); n=1; y_correct=ones(1,10); assert(isequal(P(s,n),y_correct))

y = 1 1 1 1 1 1 1 1 1 1

5   Pass
s=randi(1000,1,10)+2; n=5; y_correct=10*s-15; assert(isequal(P(s,n),y_correct))

y = 9245 4605 6485 9935 8595 3675 355 755 5265 4375

6   Pass
s=[5 6 7]'; n=[2 8 9]; y_correct=[5 92 117;6 120 153;7 148 189]; assert(isequal(P(s,n),y_correct))

y = 5 92 117 6 120 153 7 148 189

7   Pass
% for M.Z. s=[5 6 7]'; n=[2 8 9]; y_correct=[5 92 117;6 120 153;7 148 189]; assert(isequal(P(flipud(s),n),flipud(y_correct)))

y = 7 148 189 6 120 153 5 92 117

8   Pass
s=randi([3,1000]); n=randi([3,1000]); assert(P(s+1,n+1)-P(s,n+1)==P(3,n))

y = 300955663 y = 300584572 y = 371091

Suggested Problems

More from this Author41

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!