56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
---
|
||
id: 5900f4fd1000cf542c51000f
|
||
challengeType: 5
|
||
title: 'Problem 401: Sum of squares of divisors'
|
||
videoUrl: ''
|
||
localeTitle: 问题401：除数的平方和
|
||
---
|
||
|
||
## Description
|
||
<section id="description"> 6的除数是1,2,3和6.这些数的平方和是1 + 4 + 9 + 36 = 50。 <p>设sigma2（n）代表n的除数的平方和。因此sigma2（6）= 50。 </p><p>设SIGMA2表示sigma2的和函数，即对于i = 1到n，SIGMA2（n）=Σsigma2（i）。 SIGMA2的前6个值是：1,6,16,37,63和113。 </p><p>找到SIGMA2（1015）modulo 109。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler401()</code>应该返回281632621。
|
||
testString: 'assert.strictEqual(euler401(), 281632621, "<code>euler401()</code> should return 281632621.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler401() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler401();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|