ee1e8abd87
* 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>
43 lines
900 B
Markdown
43 lines
900 B
Markdown
---
|
||
id: 5900f3b11000cf542c50fec4
|
||
title: 问题69大欧拉
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-69-totient-maximum
|
||
---
|
||
|
||
# --description--
|
||
|
||
Euler的Totient函数φ（n）\[有时称为phi函数]用于确定小于n的数字的数量，这些数字是n的相对素数。例如，如1,2,4,5,7和8都小于9且相对于9，φ（9）= 6。
|
||
|
||
n相对素数φ（n）n /φ（n）2 1 1 2 3 1,2 2 1.5 4 1,3 2 2 5 1,2,3,4 4 1.25 6 1,5 2 3 7 1,2， 3,4,5,6 6 1.1666 ... 8 1,3,5,7 4 2 9 1,2,4,5,7,8 6 1.5 10 1,3,7,9 4 2.5
|
||
|
||
可以看出，对于n≤10，n = 6产生最大n /φ（n）。找到n≤1,000,000的值，其中n /φ（n）是最大值。
|
||
|
||
# --hints--
|
||
|
||
`euler69()`应该返回510510。
|
||
|
||
```js
|
||
assert.strictEqual(euler69(), 510510);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function totientMaximum() {
|
||
|
||
return true;
|
||
}
|
||
|
||
totientMaximum();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|