Files
Nicholas Carrigan (he/him) 3da4be21bb chore: seed chinese traditional (#42005)
Seeds the chinese traditional files manually so we can deploy to
staging.
2021-05-05 22:43:49 +05:30

43 lines
613 B
Markdown
Raw Permalink Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

---
id: 5900f51e1000cf542c510030
title: 'Problem 432: Totient sum'
challengeType: 5
forumTopicId: 302103
dashedName: problem-432-totient-sum
---
# --description--
Let S(n,m) = ∑φ(n × i) for 1 ≤ i ≤ m. (φ is Euler's totient function)
You are given that S(510510,106 )= 45480596821125120.
Find S(510510,1011). Give the last 9 digits of your answer.
# --hints--
`euler432()` should return 754862080.
```js
assert.strictEqual(euler432(), 754862080);
```
# --seed--
## --seed-contents--
```js
function euler432() {
return true;
}
euler432();
```
# --solutions--
```js
// solution required
```