freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-87-prime-power-trip...

39 lines
745 B
Markdown
Raw Blame History

This file contains ambiguous Unicode characters!

This file contains ambiguous Unicode characters that may be confused with others in your current locale. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to highlight these characters.

---
id: 5900f3c51000cf542c50fed8
title: 问题87Prime 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
```