56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
|
---
|
|||
|
|
id: 5900f45d1000cf542c50ff70
|
|||
|
|
challengeType: 5
|
|||
|
|
title: 'Problem 241: Perfection Quotients'
|
|||
|
|
videoUrl: ''
|
|||
|
|
localeTitle: 问题241：完美商数
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
## Description
|
|||
|
|
<section id="description">对于正整数n，令σ（n）为n的所有除数之和，因此例如σ（6）= 1 + 2 + 3 + 6 = 12。 <p>正如您所知，一个完美的数字是σ（n）= 2n的数字。 </p><p>让我们定义正整数asp（n）=σ（n）n的完美商。求出所有正整数n≤1018的和，其中p（n）的形式为k + 1/2，其中k是整数。 </p></section>
|
|||
|
|
|
|||
|
|
## Instructions
|
|||
|
|
<section id="instructions">
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Tests
|
|||
|
|
<section id='tests'>
|
|||
|
|
|
|||
|
|
```yml
|
|||
|
|
tests:
|
|||
|
|
- text: <code>euler241()</code>应该返回482316491800641150。
|
|||
|
|
testString: 'assert.strictEqual(euler241(), 482316491800641150, "<code>euler241()</code> should return 482316491800641150.");'
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Challenge Seed
|
|||
|
|
<section id='challengeSeed'>
|
|||
|
|
|
|||
|
|
<div id='js-seed'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
function euler241() {
|
|||
|
|
// Good luck!
|
|||
|
|
return true;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
euler241();
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Solution
|
|||
|
|
<section id='solution'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
// solution required
|
|||
|
|
```
|
|||
|
|
</section>
|