6cfd0fc503
* fix: improve Project Euler descriptions and test case Improve formatting of Project Euler test descriptions. Also add poker hands array and new test case for problem 54 * feat: add typeof tests and gave functions proper names for first 100 challenges * fix: continue fixing test descriptions and adding "before test" sections * fix: address review comments * fix: adjust grids in 18 and 67 and fix some text that reference files rather than the given arrays * fix: implement bug fixes and improvements from review * fix: remove console.log statements from seed and solution
1.7 KiB
1.7 KiB
id, challengeType, title, forumTopicId
| id | challengeType | title | forumTopicId |
|---|---|---|---|
| 5900f3711000cf542c50fe84 | 5 | Problem 5: Smallest multiple | 302160 |
Description
2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.
What is the smallest positive number that is evenly divisible by all of the numbers from 1 to n?
Instructions
Tests
tests:
- text: <code>smallestMult(5)</code> should return a number.
testString: assert(typeof smallestMult(5) === 'number');
- text: <code>smallestMult(5)</code> should return 60.
testString: assert.strictEqual(smallestMult(5), 60);
- text: <code>smallestMult(7)</code> should return 420.
testString: assert.strictEqual(smallestMult(7), 420);
- text: <code>smallestMult(10)</code> should return 2520.
testString: assert.strictEqual(smallestMult(10), 2520);
- text: <code>smallestMult(13)</code> should return 360360.
testString: assert.strictEqual(smallestMult(13), 360360);
- text: <code>smallestMult(20)</code> should return 232792560.
testString: assert.strictEqual(smallestMult(20), 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;
}