freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-432-totient-sum.md

---
id: 5900f51e1000cf542c510030
challengeType: 5
videoUrl: ''
localeTitle: 问题432欧拉
---

## Description
<section id="description">
令S（n，m）= ∑φ（n×i）且1≤i≤m。 （φ是欧拉的上位函数）
给出S（510510,106）= 45480596821125120。


找出S（510510,1011）。
输入答案的最后9位数字。
</section>

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

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler432()</code>应该返回754862080。
    testString: assert.strictEqual(euler432(), 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>