Cody

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

Solution 3380893

Submitted on 25 Oct 2020 by Sibi
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   Pass
assert(isequal(div_tri_n(2),6))

y = 6 divisors_per_term = 6

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

y = 6 divisors_per_term = 6

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

y = 36 divisors_per_term = 10

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

y = 120 divisors_per_term = 16

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

y = 630 divisors_per_term = 24

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

y = 2016 divisors_per_term = 36

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

y = 3240 divisors_per_term = 40

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

y = 5460 divisors_per_term = 48

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

y = 25200 divisors_per_term = 90

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

y = 25200 divisors_per_term = 90

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

y = 25200 divisors_per_term = 90

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

y = 73920 divisors_per_term = 112

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

y = 157080 divisors_per_term = 128

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

y = 157080 divisors_per_term = 128

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

y = 437580 divisors_per_term = 144

### Community Treasure Hunt

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

Start Hunting!