56 lines
1.0 KiB
Markdown
56 lines
1.0 KiB
Markdown
|
---
|
|||
|
id: 5900f3c51000cf542c50fed8
|
|||
|
challengeType: 5
|
|||
|
title: 'Problem 87: Prime power triples'
|
|||
|
videoUrl: ''
|
|||
|
localeTitle: 问题87:Prime power三倍
|
|||
|
---
|
|||
|
|
|||
|
## Description
|
|||
|
<section id="description">可表示为素数平方,素数立方和素数四次幂之和的最小数是28.事实上,正好有四个数字低于五十,可以用这样的方式表示:28 = 22 + 23 + 24 33 = 32 + 23 + 24 49 = 52 + 23 + 24 47 = 22 + 33 + 24五千万以下的数字可以表示为素数,素数和素数四次幂之和? </section>
|
|||
|
|
|||
|
## Instructions
|
|||
|
<section id="instructions">
|
|||
|
</section>
|
|||
|
|
|||
|
## Tests
|
|||
|
<section id='tests'>
|
|||
|
|
|||
|
```yml
|
|||
|
tests:
|
|||
|
- text: <code>euler87()</code>应该返回1097343。
|
|||
|
testString: 'assert.strictEqual(euler87(), 1097343, "<code>euler87()</code> should return 1097343.");'
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Challenge Seed
|
|||
|
<section id='challengeSeed'>
|
|||
|
|
|||
|
<div id='js-seed'>
|
|||
|
|
|||
|
```js
|
|||
|
function euler87() {
|
|||
|
// Good luck!
|
|||
|
return true;
|
|||
|
}
|
|||
|
|
|||
|
euler87();
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</div>
|
|||
|
|
|||
|
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Solution
|
|||
|
<section id='solution'>
|
|||
|
|
|||
|
```js
|
|||
|
// solution required
|
|||
|
```
|
|||
|
</section>
|