45 lines
731 B
Markdown
45 lines
731 B
Markdown
|
---
|
||
|
|
id: 5900f5231000cf542c510035
|
||
|
|
title: 'Problem 439: Sum of sum of divisors'
|
||
|
|
challengeType: 5
|
||
|
|
forumTopicId: 302110
|
||
|
|
dashedName: problem-439-sum-of-sum-of-divisors
|
||
|
|
---
|
||
|
|
|
||
|
|
# --description--
|
||
|
|
|
||
|
|
Let d(k) be the sum of all divisors of k.
|
||
|
|
|
||
|
|
We define the function S(N) = ∑1≤i≤N ∑1≤j≤Nd(i·j).
|
||
|
|
|
||
|
|
For example, S(3) = d(1) + d(2) + d(3) + d(2) + d(4) + d(6) + d(3) + d(6) + d(9) = 59.
|
||
|
|
|
||
|
|
You are given that S(103) = 563576517282 and S(105) mod 109 = 215766508. Find S(1011) mod 109.
|
||
|
|
|
||
|
|
# --hints--
|
||
|
|
|
||
|
|
`euler439()` should return 968697378.
|
||
|
|
|
||
|
|
```js
|
||
|
|
assert.strictEqual(euler439(), 968697378);
|
||
|
|
```
|
||
|
|
|
||
|
|
# --seed--
|
||
|
|
|
||
|
|
## --seed-contents--
|
||
|
|
|
||
|
|
```js
|
||
|
|
function euler439() {
|
||
|
|
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
euler439();
|
||
|
|
```
|
||
|
|
|
||
|
|
# --solutions--
|
||
|
|
|
||
|
|
```js
|
||
|
|
// solution required
|
||
|
|
```
|