Files
freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-70-totient-permutation.md
Oliver Eyton-Williams ee1e8abd87 feat(curriculum): restore seed + solution to Chinese (#40683)
* feat(tools): add seed/solution restore script

* chore(curriculum): remove empty sections' markers

* chore(curriculum): add seed + solution to Chinese

* chore: remove old formatter

* fix: update getChallenges

parse translated challenges separately, without reference to the source

* chore(curriculum): add dashedName to English

* chore(curriculum): add dashedName to Chinese

* refactor: remove unused challenge property 'name'

* fix: relax dashedName requirement

* fix: stray tag

Remove stray `pre` tag from challenge file.

Signed-off-by: nhcarrigan <nhcarrigan@gmail.com>

Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
2021-01-12 19:31:00 -07:00

39 lines
873 B
Markdown
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

---
id: 5900f3b21000cf542c50fec5
title: 问题70欧拉置换
challengeType: 5
videoUrl: ''
dashedName: problem-70-totient-permutation
---
# --description--
Euler的Totient函数φn\[有时称为phi函数]用于确定小于或等于n的正数的数量它们是n的相对素数。例如如1,2,4,5,7和8都小于9且相对素数为9φ9= 6.数字1被认为是每个正数的相对素数所以φ1= 1。有趣的是φ87109= 79180可以看出87109是79180的置换。找到n的值1 &lt;n &lt;107其中φn是n的置换和比率n / φn产生最小值。
# --hints--
`euler70()`应该返回8319823。
```js
assert.strictEqual(euler70(), 8319823);
```
# --seed--
## --seed-contents--
```js
function totientPermutation() {
return true;
}
totientPermutation();
```
# --solutions--
```js
// solution required
```