Cody

# Problem 44732. Highly divisible triangular number (inspired by Project Euler 12)

Solution 1976793

Submitted on 15 Oct 2019
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
assessFunctionAbsence({'regexp', 'regexpi', 'str2num'},'FileName','div_tri_n.m')

2   Fail
assert(isequal(div_tri_n(2),6))

num = 3

Assertion failed.

3   Fail
assert(isequal(div_tri_n(4),28))

num = 6

Assertion failed.

4   Pass
assert(isequal(div_tri_n(8),36))

num = 36

5   Pass
assert(isequal(div_tri_n(10),120))

num = 120

6   Fail
assert(isequal(div_tri_n(20),630))

num = 528

Assertion failed.

7   Pass
assert(isequal(div_tri_n(25),2016))

num = 2016

8   Pass
assert(isequal(div_tri_n(39),3240))

num = 3240

9   Fail
assert(isequal(div_tri_n(40),5460))

num = 3240

Assertion failed.

10   Pass
assert(isequal(div_tri_n(50),25200))

num = 25200

11   Pass
assert(isequal(div_tri_n(70),25200))

num = 25200

12   Pass
assert(isequal(div_tri_n(80),25200))

num = 25200

13   Pass
assert(isequal(div_tri_n(100),73920))

num = 73920

14   Pass
assert(isequal(div_tri_n(115),157080))

num = 157080

15   Pass
assert(isequal(div_tri_n(120),157080))

num = 157080

16   Pass
assert(isequal(div_tri_n(130),437580))

num = 437580