61460c8601
search and replace ```\n< with ```\n\n< to ensure there's an empty line before closing tags
64 lines
1009 B
Markdown
64 lines
1009 B
Markdown
---
|
||
id: 5900f5231000cf542c510035
|
||
challengeType: 5
|
||
title: 'Problem 439: Sum of sum of divisors'
|
||
videoUrl: ''
|
||
localeTitle: 问题439：除数之和
|
||
---
|
||
|
||
## Description
|
||
<section id="description">
|
||
令d（k）是k的所有除数之和。
|
||
我们定义函数S（N）= ∑1≤i≤N ∑1≤j≤Nd（i·j）。
|
||
例如，S（3）= d（1）+ d（2）+ d（3）+ d（2）+ d（4）+ d（6）+ d（3）+ d（6）+ d（ 9）= 59。
|
||
|
||
给出S（103）= 563576517282和S（105）mod 109 = 215766508。
|
||
找出S（1011）mod 109。
|
||
</section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler439()</code>应该返回968697378。
|
||
testString: assert.strictEqual(euler439(), 968697378);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler439() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler439();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
/section>
|