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.8 KiB
1.8 KiB
id, challengeType, title, forumTopicId
| id | challengeType | title | forumTopicId |
|---|---|---|---|
| 5900f36f1000cf542c50fe82 | 5 | Problem 3: Largest prime factor | 301952 |
Description
The prime factors of 13195 are 5, 7, 13 and 29.
What is the largest prime factor of the given number?
Instructions
Tests
tests:
- text: <code>largestPrimeFactor(2)</code> should return a number.
testString: assert(typeof largestPrimeFactor(2) === 'number');
- text: <code>largestPrimeFactor(2)</code> should return 2.
testString: assert.strictEqual(largestPrimeFactor(2), 2);
- text: <code>largestPrimeFactor(3)</code> should return 3.
testString: assert.strictEqual(largestPrimeFactor(3), 3);
- text: <code>largestPrimeFactor(5)</code> should return 5.
testString: assert.strictEqual(largestPrimeFactor(5), 5);
- text: <code>largestPrimeFactor(7)</code> should return 7.
testString: assert.strictEqual(largestPrimeFactor(7), 7);
- text: <code>largestPrimeFactor(13195)</code> should return 29.
testString: assert.strictEqual(largestPrimeFactor(13195), 29);
- text: <code>largestPrimeFactor(600851475143)</code> should return 6857.
testString: assert.strictEqual(largestPrimeFactor(600851475143), 6857);
Challenge Seed
function largestPrimeFactor(number) {
// Good luck!
return true;
}
largestPrimeFactor(13195);
Solution
const largestPrimeFactor = (number)=>{
let largestFactor = number;
for(let i = 2;i<largestFactor;i++){
if(!(largestFactor%i)){
largestFactor = largestFactor/i;
largestPrimeFactor(largestFactor);
}
}
return largestFactor;
}