Cody

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

Solution 1825839

Submitted on 25 May 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))

Assertion failed.

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

Assertion failed.

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

Assertion failed.

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

Assertion failed.

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

Assertion failed.

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

Assertion failed.

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

Assertion failed.

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

Assertion failed.

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

Assertion failed.

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

Assertion failed.

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

Assertion failed.

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

Assertion failed.

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

Assertion failed.

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

Assertion failed.

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

Assertion failed.