1.6 KiB
1.6 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f3711000cf542c50fe84 | 5 | Problem 5: Smallest multiple | 问题5:最小的倍数 |
Description
n
所有数字均可被整除的最小正数是多少? Instructions
Tests
tests:
- text: <code>smallestMult(5)</code>应该返回60。
testString: 'assert.strictEqual(smallestMult(5), 60, "<code>smallestMult(5)</code> should return 60.");'
- text: <code>smallestMult(7)</code>应该返回420。
testString: 'assert.strictEqual(smallestMult(7), 420, "<code>smallestMult(7)</code> should return 420.");'
- text: <code>smallestMult(10)</code>应返回2520。
testString: 'assert.strictEqual(smallestMult(10), 2520, "<code>smallestMult(10)</code> should return 2520.");'
- text: <code>smallestMult(13)</code>应返回360360。
testString: 'assert.strictEqual(smallestMult(13), 360360, "<code>smallestMult(13)</code> should return 360360.");'
- text: <code>smallestMult(20)</code>应该返回232792560。
testString: 'assert.strictEqual(smallestMult(20), 232792560, "<code>smallestMult(20)</code> should return 232792560.");'
Challenge Seed
function smallestMult(n) {
// Good luck!
return true;
}
smallestMult(20);
Solution
// solution required