2018-10-10 18:03:03 -04:00
|
|
|
|
---
|
|
|
|
|
id: 5900f36f1000cf542c50fe82
|
2021-11-17 03:53:39 -08:00
|
|
|
|
title: '问题 3:最大素数因子'
|
2018-10-10 18:03:03 -04:00
|
|
|
|
challengeType: 5
|
2021-02-06 04:42:36 +00:00
|
|
|
|
forumTopicId: 301952
|
2021-01-13 03:31:00 +01:00
|
|
|
|
dashedName: problem-3-largest-prime-factor
|
2018-10-10 18:03:03 -04:00
|
|
|
|
---
|
|
|
|
|
|
2020-12-16 00:37:30 -07:00
|
|
|
|
# --description--
|
|
|
|
|
|
2021-11-17 03:53:39 -08:00
|
|
|
|
13195 的素数因子是 5、7、13 和 29。
|
2018-10-10 18:03:03 -04:00
|
|
|
|
|
2021-11-17 03:53:39 -08:00
|
|
|
|
求给出数 `number` 的最大素数因子是多少?
|
2018-10-10 18:03:03 -04:00
|
|
|
|
|
2020-12-16 00:37:30 -07:00
|
|
|
|
# --hints--
|
2018-10-10 18:03:03 -04:00
|
|
|
|
|
2021-11-17 03:53:39 -08:00
|
|
|
|
`largestPrimeFactor(2)` 应该返回一个数字。
|
2021-02-06 04:42:36 +00:00
|
|
|
|
|
|
|
|
|
```js
|
|
|
|
|
assert(typeof largestPrimeFactor(2) === 'number');
|
|
|
|
|
```
|
|
|
|
|
|
2021-11-17 03:53:39 -08:00
|
|
|
|
`largestPrimeFactor(2)` 应该返回 2。
|
2020-12-16 00:37:30 -07:00
|
|
|
|
|
|
|
|
|
```js
|
|
|
|
|
assert.strictEqual(largestPrimeFactor(2), 2);
|
|
|
|
|
```
|
2018-10-10 18:03:03 -04:00
|
|
|
|
|
2021-11-17 03:53:39 -08:00
|
|
|
|
`largestPrimeFactor(3)` 应该返回 3。
|
2018-10-10 18:03:03 -04:00
|
|
|
|
|
|
|
|
|
```js
|
2020-12-16 00:37:30 -07:00
|
|
|
|
assert.strictEqual(largestPrimeFactor(3), 3);
|
|
|
|
|
```
|
2018-10-10 18:03:03 -04:00
|
|
|
|
|
2021-11-17 03:53:39 -08:00
|
|
|
|
`largestPrimeFactor(5)` 应该返回 5。
|
2018-10-10 18:03:03 -04:00
|
|
|
|
|
2020-12-16 00:37:30 -07:00
|
|
|
|
```js
|
|
|
|
|
assert.strictEqual(largestPrimeFactor(5), 5);
|
2018-10-10 18:03:03 -04:00
|
|
|
|
```
|
|
|
|
|
|
2021-11-17 03:53:39 -08:00
|
|
|
|
`largestPrimeFactor(7)` 应该返回 7。
|
2018-10-10 18:03:03 -04:00
|
|
|
|
|
2020-12-16 00:37:30 -07:00
|
|
|
|
```js
|
|
|
|
|
assert.strictEqual(largestPrimeFactor(7), 7);
|
|
|
|
|
```
|
2018-10-10 18:03:03 -04:00
|
|
|
|
|
2021-11-17 03:53:39 -08:00
|
|
|
|
`largestPrimeFactor(8)` 应该返回 2。
|
2021-02-06 04:42:36 +00:00
|
|
|
|
|
|
|
|
|
```js
|
|
|
|
|
assert.strictEqual(largestPrimeFactor(8), 2);
|
|
|
|
|
```
|
|
|
|
|
|
2021-11-17 03:53:39 -08:00
|
|
|
|
`largestPrimeFactor(13195)` 应该返回 29。
|
2018-10-10 18:03:03 -04:00
|
|
|
|
|
2020-12-16 00:37:30 -07:00
|
|
|
|
```js
|
|
|
|
|
assert.strictEqual(largestPrimeFactor(13195), 29);
|
|
|
|
|
```
|
2018-10-10 18:03:03 -04:00
|
|
|
|
|
2021-11-17 03:53:39 -08:00
|
|
|
|
`largestPrimeFactor(600851475143)` 应该返回 6857。
|
2018-10-10 18:03:03 -04:00
|
|
|
|
|
|
|
|
|
```js
|
2020-12-16 00:37:30 -07:00
|
|
|
|
assert.strictEqual(largestPrimeFactor(600851475143), 6857);
|
2018-10-10 18:03:03 -04:00
|
|
|
|
```
|
2020-08-13 17:24:35 +02:00
|
|
|
|
|
2021-01-13 03:31:00 +01:00
|
|
|
|
# --seed--
|
|
|
|
|
|
|
|
|
|
## --seed-contents--
|
|
|
|
|
|
|
|
|
|
```js
|
|
|
|
|
function largestPrimeFactor(number) {
|
|
|
|
|
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
largestPrimeFactor(13195);
|
|
|
|
|
```
|
|
|
|
|
|
2020-12-16 00:37:30 -07:00
|
|
|
|
# --solutions--
|
|
|
|
|
|
2021-01-13 03:31:00 +01:00
|
|
|
|
```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;
|
|
|
|
|
}
|
|
|
|
|
```
|