1.8 KiB
1.8 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f36f1000cf542c50fe82 | 5 | Problem 3: Largest prime factor | Problema 3: Maior fator primordial |
Description
number
dado? Instructions
Tests
tests:
- text: <code>largestPrimeFactor(2)</code> deve retornar 2.
testString: 'assert.strictEqual(largestPrimeFactor(2), 2, "<code>largestPrimeFactor(2)</code> should return 2.");'
- text: <code>largestPrimeFactor(3)</code> deve retornar 3.
testString: 'assert.strictEqual(largestPrimeFactor(3), 3, "<code>largestPrimeFactor(3)</code> should return 3.");'
- text: <code>largestPrimeFactor(5)</code> deve retornar 5.
testString: 'assert.strictEqual(largestPrimeFactor(5), 5, "<code>largestPrimeFactor(5)</code> should return 5.");'
- text: <code>largestPrimeFactor(7)</code> deve retornar 7.
testString: 'assert.strictEqual(largestPrimeFactor(7), 7, "<code>largestPrimeFactor(7)</code> should return 7.");'
- text: <code>largestPrimeFactor(13195)</code> deve retornar 29.
testString: 'assert.strictEqual(largestPrimeFactor(13195), 29, "<code>largestPrimeFactor(13195)</code> should return 29.");'
- text: <code>largestPrimeFactor(600851475143)</code> deve retornar 6857.
testString: 'assert.strictEqual(largestPrimeFactor(600851475143), 6857, "<code>largestPrimeFactor(600851475143)</code> should return 6857.");'
Challenge Seed
function largestPrimeFactor(number) {
// Good luck!
return true;
}
largestPrimeFactor(13195);
Solution
// solution required