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>
43 lines
762 B
Markdown
43 lines
762 B
Markdown
---
|
||
id: 5900f45d1000cf542c50ff70
|
||
title: 问题241：完美商数
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-241-perfection-quotients
|
||
---
|
||
|
||
# --description--
|
||
|
||
对于正整数n，令σ（n）为n的所有除数之和，因此例如σ（6）= 1 + 2 + 3 + 6 = 12。
|
||
|
||
正如您所知，一个完美的数字是σ（n）= 2n的数字。
|
||
|
||
让我们定义正整数asp（n）=σ（n）n的完美商。求出所有正整数n≤1018的和，其中p（n）的形式为k + 1/2，其中k是整数。
|
||
|
||
# --hints--
|
||
|
||
`euler241()`应该返回482316491800641150。
|
||
|
||
```js
|
||
assert.strictEqual(euler241(), 482316491800641150);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler241() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler241();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|