ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
96 lines
1.6 KiB
Markdown
96 lines
1.6 KiB
Markdown
---
|
|
id: 5900f36f1000cf542c50fe82
|
|
title: 'Problem 3: Largest prime factor'
|
|
challengeType: 5
|
|
forumTopicId: 301952
|
|
dashedName: problem-3-largest-prime-factor
|
|
---
|
|
|
|
# --description--
|
|
|
|
The prime factors of 13195 are 5, 7, 13 and 29.
|
|
|
|
What is the largest prime factor of the given `number`?
|
|
|
|
# --hints--
|
|
|
|
`largestPrimeFactor(2)` should return a number.
|
|
|
|
```js
|
|
assert(typeof largestPrimeFactor(2) === 'number');
|
|
```
|
|
|
|
`largestPrimeFactor(2)` should return 2.
|
|
|
|
```js
|
|
assert.strictEqual(largestPrimeFactor(2), 2);
|
|
```
|
|
|
|
`largestPrimeFactor(3)` should return 3.
|
|
|
|
```js
|
|
assert.strictEqual(largestPrimeFactor(3), 3);
|
|
```
|
|
|
|
`largestPrimeFactor(5)` should return 5.
|
|
|
|
```js
|
|
assert.strictEqual(largestPrimeFactor(5), 5);
|
|
```
|
|
|
|
`largestPrimeFactor(7)` should return 7.
|
|
|
|
```js
|
|
assert.strictEqual(largestPrimeFactor(7), 7);
|
|
```
|
|
|
|
`largestPrimeFactor(8)` should return 2.
|
|
|
|
```js
|
|
assert.strictEqual(largestPrimeFactor(8), 2);
|
|
```
|
|
|
|
`largestPrimeFactor(13195)` should return 29.
|
|
|
|
```js
|
|
assert.strictEqual(largestPrimeFactor(13195), 29);
|
|
```
|
|
|
|
`largestPrimeFactor(600851475143)` should return 6857.
|
|
|
|
```js
|
|
assert.strictEqual(largestPrimeFactor(600851475143), 6857);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function largestPrimeFactor(number) {
|
|
|
|
return true;
|
|
}
|
|
|
|
largestPrimeFactor(13195);
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
const largestPrimeFactor = (number) => {
|
|
let largestFactor = number;
|
|
|
|
for (let i = 2; i <= Math.sqrt(largestFactor); i++) {
|
|
if (!(largestFactor % i)) {
|
|
let factor = largestFactor / i;
|
|
let candidate = largestPrimeFactor(factor);
|
|
|
|
return i > candidate ? i : candidate;
|
|
}
|
|
}
|
|
|
|
return largestFactor;
|
|
}
|
|
```
|