1.8 KiB
1.8 KiB
id | challengeType | title |
---|---|---|
5900f3711000cf542c50fe84 | 5 | Problem 5: Smallest multiple |
Description
n
?
Instructions
Tests
tests:
- text: <code>smallestMult(5)</code> should return 60.
testString: assert.strictEqual(smallestMult(5), 60, '<code>smallestMult(5)</code> should return 60.');
- text: <code>smallestMult(7)</code> should return 420.
testString: assert.strictEqual(smallestMult(7), 420, '<code>smallestMult(7)</code> should return 420.');
- text: <code>smallestMult(10)</code> should return 2520.
testString: assert.strictEqual(smallestMult(10), 2520, '<code>smallestMult(10)</code> should return 2520.');
- text: <code>smallestMult(13)</code> should return 360360.
testString: assert.strictEqual(smallestMult(13), 360360, '<code>smallestMult(13)</code> should return 360360.');
- text: <code>smallestMult(20)</code> should return 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
function smallestMult(n){
function gcd(a, b) {
return b === 0 ? a : gcd(b, a%b); // Euclidean algorithm
}
function lcm(a, b) {
return a * b / gcd(a, b);
}
var result = 1;
for(var i = 2; i <= n; i++) {
result = lcm(result, i);
}
return result;
}