gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

chore(learn): Applied MDX format to Chinese curriculum files (#40462)

Browse Source
This commit is contained in:
Randell Dawson
2020-12-16 00:37:30 -07:00
committed by GitHub
parent 873fce02a2
commit 9ce4a02a41
1665 changed files with 58741 additions and 88042 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -1,62 +1,25 @@
---
id: 5900f51e1000cf542c510030
title: 问题432欧拉
challengeType: 5
videoUrl: ''
title: 问题432欧拉
---
## Description
<section id="description">
# --description--
令S（n，m）= ∑φ（n×i）且1≤i≤m。 （φ是欧拉的上位函数）
给出S（510510,106）= 45480596821125120。
找出S（510510,1011）。 输入答案的最后9位数字。
找出S（510510,1011）。
输入答案的最后9位数字。
</section>
# --hints--
## 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'>
`euler432()`应该返回754862080。
```js
function euler432() {
// Good luck!
return true;
}
euler432();
assert.strictEqual(euler432(), 754862080);
```
</div>
# --solutions--
</section>
## Solution
<section id='solution'>
```js
// solution required
```
/section>