2018-10-08 17:51:51 +00:00
---
2018-10-10 20:20:40 +00:00
id: 5900f51e1000cf542c510030
2018-10-08 17:51:51 +00:00
challengeType: 5
title: 'Problem 432: Totient sum'
2018-10-10 20:20:40 +00:00
videoUrl: ''
localeTitle: Problema 432 a totient
2018-10-08 17:51:51 +00:00
---
## Description
2018-10-10 20:20:40 +00:00
< section id = "description" > Sea S (n, m) = ∑φ (n × i) para 1 ≤ i ≤ m. (φ es la función total de Euler) Se le da que S (510510,106) = 45480596821125120. < p > Encontrar S (510510,1011). Da los últimos 9 dígitos de tu respuesta. < / p > < / section >
2018-10-08 17:51:51 +00:00
## Instructions
2018-10-10 20:20:40 +00:00
< section id = "instructions" >
2018-10-08 17:51:51 +00:00
< / section >
## Tests
< section id = 'tests' >
```yml
tests:
- text: < code > euler432()</ code > debe devolver 754862080.
testString: 'assert.strictEqual(euler432(), 754862080, "< code > euler432()< / code > should return 754862080.");'
```
< / section >
## Challenge Seed
< section id = 'challengeSeed' >
< div id = 'js-seed' >
```js
function euler432() {
// Good luck!
return true;
}
euler432();
2018-10-10 20:20:40 +00:00
2018-10-08 17:51:51 +00:00
```
< / div >
< / section >
## Solution
< section id = 'solution' >
```js
// solution required
```
< / section >