* 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>
39 lines
873 B
Markdown
39 lines
873 B
Markdown
---
|
||
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 <n <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
|
||
```
|