56 lines
970 B
Markdown
56 lines
970 B
Markdown
---
|
||
id: 5900f3ef1000cf542c50ff02
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
title: 问题131：Prime立方体伙伴关系
|
||
---
|
||
|
||
## Description
|
||
<section id="description">存在一些素数值p，其中存在正整数n，使得表达式n3 + n2p是完美的立方体。例如，当p = 19时，83 + 82×19 = 123.最令人惊讶的是，对于具有此属性的每个素数，n的值是唯一的，并且在100之下只有四个这样的素数。一百万以下的素数有多少这个非凡的财产？ </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler131()</code>应该返回173。
|
||
testString: assert.strictEqual(euler131(), 173);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler131() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler131();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
/section>
|