Problem 5. Triangle Numbers

Solution 330874

Submitted on 8 Oct 2013 by Tanmayee

This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Micah Beckman on 5 Sep 2016

Okay, so we can definitely do better than a for loop...

Zhengyi on 21 Mar 2018

@Micah Beckman no, this solution is not an "efficient" answer even though it scores high... one should use sum(1:n) to replace a for loop sum.

Test	Status	Code Input and Output
1	Pass	%% n = 1; t = 1; assert(isequal(triangle(n),t)) t = 1 ans = []
2	Pass	%% n = 3; t = 6; assert(isequal(triangle(n),t)) t = 6 ans = []
3	Pass	%% n = 5; t = 15; assert(isequal(triangle(n),t)) t = 15 ans = []
4	Pass	%% n = 30; t = 465; assert(isequal(triangle(n),t)) t = 465 ans = []