---
id: 5900f51e1000cf542c510030
challengeType: 5
title: 'Problem 432: Totient sum'
videoUrl: ''
localeTitle: ''
---

## Description
<section id="description"> Seja S (n, m) = ∑φ (n × i) para 1 ≤ i ≤ m. (φ é a função totiente de Euler) Você recebe o S (510510,106) = 45480596821125120. <p> Encontre S (510510,1011). Dê os últimos 9 dígitos da sua resposta. </p></section>

## Instructions
<section id="instructions">
</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: ''
    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>