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

Solution 1821156

Submitted on 21 May 2019 by Jean-Marie Sainthillier

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	assessFunctionAbsence({'regexp', 'regexpi', 'str2num'},'FileName','div_tri_n.m')
2	Pass	assert(isequal(div_tri_n(2),6))
3	Pass	assert(isequal(div_tri_n(4),28))
4	Pass	assert(isequal(div_tri_n(8),36))
5	Pass	assert(isequal(div_tri_n(10),120))
6	Pass	assert(isequal(div_tri_n(20),630))
7	Pass	assert(isequal(div_tri_n(25),2016))
8	Pass	assert(isequal(div_tri_n(39),3240))
9	Pass	assert(isequal(div_tri_n(40),5460))
10	Pass	assert(isequal(div_tri_n(50),25200))
11	Pass	assert(isequal(div_tri_n(70),25200))
12	Pass	assert(isequal(div_tri_n(80),25200))
13	Pass	assert(isequal(div_tri_n(100),73920))
14	Pass	assert(isequal(div_tri_n(115),157080))
15	Pass	assert(isequal(div_tri_n(120),157080))
16	Pass	assert(isequal(div_tri_n(130),437580))