2.5 KiB
2.5 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f3781000cf542c50fe8b | 5 | Problem 12: Highly divisible triangular number | 问题12:高度可分的三角数 |
Description
1,3,6,10,15,21,28,36,45,55 ......
让我们列出前七个三角形数字的因子: 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
我们可以看到28是第一个超过五个除数的三角形数。超过n
除数的第一个三角形数的值是多少? Instructions
Tests
tests:
- text: <code>divisibleTriangleNumber(5)</code>应该返回28。
testString: 'assert.strictEqual(divisibleTriangleNumber(5), 28, "<code>divisibleTriangleNumber(5)</code> should return 28.");'
- text: <code>divisibleTriangleNumber(23)</code>应该返回630。
testString: 'assert.strictEqual(divisibleTriangleNumber(23), 630, "<code>divisibleTriangleNumber(23)</code> should return 630.");'
- text: divisibleTriangleNumber <code>divisibleTriangleNumber(167)</code>应该返回1385280。
testString: 'assert.strictEqual(divisibleTriangleNumber(167), 1385280, "<code>divisibleTriangleNumber(167)</code> should return 1385280.");'
- text: divisibleTriangleNumber <code>divisibleTriangleNumber(374)</code>应该返回17907120。
testString: 'assert.strictEqual(divisibleTriangleNumber(374), 17907120, "<code>divisibleTriangleNumber(374)</code> should return 17907120.");'
- text: divisibleTriangleNumber <code>divisibleTriangleNumber(500)</code>应该返回76576500。
testString: 'assert.strictEqual(divisibleTriangleNumber(500), 76576500, "<code>divisibleTriangleNumber(500)</code> should return 76576500.");'
Challenge Seed
function divisibleTriangleNumber(n) {
// Good luck!
return true;
}
divisibleTriangleNumber(500);
Solution
// solution required