Files
freeCodeCamp/curriculum/challenges/spanish/08-coding-interview-prep/project-euler/problem-432-totient-sum.spanish.md

62 lines
911 B
Markdown
Raw Normal View History

---
id: 5
localeTitle: 5900f51e1000cf542c510030
challengeType: 5
title: 'Problem 432: Totient sum'
---
## Description
<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.
Encuentre S (510510,1011).
Da los últimos 9 dígitos de tu respuesta.
</section>
## Instructions
<section id='instructions'>
</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();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>