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>
51 lines
1.1 KiB
Markdown
51 lines
1.1 KiB
Markdown
---
|
||
id: 5900f49b1000cf542c50ffad
|
||
title: 问题302：强阿喀琉斯数
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-302-strong-achilles-numbers
|
||
---
|
||
|
||
# --description--
|
||
|
||
如果p2是n中每个素数p的n的因数，则正整数n是有力的。
|
||
|
||
如果n可以表示为另一个正整数的幂，则正整数n是理想幂。
|
||
|
||
如果n是强大的，但不是完美的幂，则正整数n是阿喀琉斯数。 例如，864和1800是阿喀琉斯数字：864 = 25·33和1800 = 23·32·52。
|
||
|
||
如果S和φ（S）都是阿喀琉斯数，我们将正整数S称为强阿喀琉斯数.1 例如，864是强致命弱点数：φ（864）= 288 = 25·32。 但是，1800不是强阿喀琉斯数字，因为：（1800）= 480 = 25·31·51。
|
||
|
||
低于104的有7个强弱点和低于108的656。
|
||
|
||
1018以下有多少个强阿喀琉斯数字？
|
||
|
||
1φ表示欧拉的拉伸函数。
|
||
|
||
# --hints--
|
||
|
||
`euler302()`应该返回1170060。
|
||
|
||
```js
|
||
assert.strictEqual(euler302(), 1170060);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler302() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler302();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|