Triangular numbers can be calculated by the sum from 1 to n. For example, the first 10 triangular numbers are:
1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...
All divisors for each of these numbers are listed below
1: 1 3: 1,3 6: 1,2,3,6 10: 1,2,5,10 15: 1,3,5,15 21: 1,3,7,21 28: 1,2,4,7,14,28 36: 1,2,3,4,6,9,12,18,36 45: 1,3,5,9,15,45 55: 1,5,11,55
Your challenge is to write a function that will return the value of the first triangular number to have over d divisors (d will be passed to your function).
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers174
Suggested Problems
-
Find the stride of the longest skip sequence
196 Solvers
-
1543 Solvers
-
12491 Solvers
-
Triangular matrices in 3D array
180 Solvers
-
Sums of Multiple Pairs of Triangular Numbers
249 Solvers
More from this Author139
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Why are so many solutions lost?