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>
39 lines
745 B
Markdown
39 lines
745 B
Markdown
---
|
||
id: 5900f3c51000cf542c50fed8
|
||
title: 问题87：Prime power三倍
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-87-prime-power-triples
|
||
---
|
||
|
||
# --description--
|
||
|
||
可表示为素数平方，素数立方和素数四次幂之和的最小数是28.事实上，正好有四个数字低于五十，可以用这样的方式表示：28 = 22 + 23 + 24 33 = 32 + 23 + 24 49 = 52 + 23 + 24 47 = 22 + 33 + 24五千万以下的数字可以表示为素数，素数和素数四次幂之和？
|
||
|
||
# --hints--
|
||
|
||
`euler87()`应该返回1097343。
|
||
|
||
```js
|
||
assert.strictEqual(euler87(), 1097343);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function primePowerTriples() {
|
||
|
||
return true;
|
||
}
|
||
|
||
primePowerTriples();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|