- var methods = require('./eulerMethods.js');
- var problem12 = function() {
- var n=1;
- var triangle = 0;
- var divisors
- while (true) {
- triangle +=n;
- divisors=methods.divisors_count(triangle);
- if (divisors>=100) {
- console.log(triangle, divisors);
- }
- if (divisors >= 500) {return triangle}
- n += 1;
- }
- }
- console.log(problem12());