2018-10-10 22:03:03 +00:00
|
|
|
|
---
|
|
|
|
|
id: 5900f49b1000cf542c50ffad
|
|
|
|
|
challengeType: 5
|
|
|
|
|
videoUrl: ''
|
2020-10-01 15:54:21 +00:00
|
|
|
|
title: 问题302:强阿喀琉斯数
|
2018-10-10 22:03:03 +00:00
|
|
|
|
---
|
|
|
|
|
|
|
|
|
|
## Description
|
2020-02-17 16:40:55 +00:00
|
|
|
|
<section id="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φ表示欧拉的拉伸函数。
|
|
|
|
|
</section>
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
|
|
|
|
## Instructions
|
2020-02-17 16:40:55 +00:00
|
|
|
|
<section id="instructions">
|
|
|
|
|
</section>
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
|
|
|
|
## Tests
|
|
|
|
|
<section id='tests'>
|
|
|
|
|
|
|
|
|
|
```yml
|
|
|
|
|
tests:
|
2020-02-17 16:40:55 +00:00
|
|
|
|
- text: <code>euler302()</code>应该返回1170060。
|
|
|
|
|
testString: assert.strictEqual(euler302(), 1170060);
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
|
|
|
|
|
</section>
|
|
|
|
|
|
|
|
|
|
## Challenge Seed
|
|
|
|
|
<section id='challengeSeed'>
|
|
|
|
|
|
|
|
|
|
<div id='js-seed'>
|
|
|
|
|
|
|
|
|
|
```js
|
|
|
|
|
function euler302() {
|
|
|
|
|
// Good luck!
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
euler302();
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
</section>
|
|
|
|
|
|
|
|
|
|
## Solution
|
|
|
|
|
<section id='solution'>
|
|
|
|
|
|
|
|
|
|
```js
|
|
|
|
|
// solution required
|
|
|
|
|
```
|
2020-08-13 15:24:35 +00:00
|
|
|
|
|
|
|
|
|
/section>
|