54 lines
1.1 KiB
Markdown
54 lines
1.1 KiB
Markdown
|
---
|
||
|
|
id: 5900f3c51000cf542c50fed8
|
||
|
|
title: 'Problem 87: Prime power triples'
|
||
|
|
challengeType: 5
|
||
|
|
forumTopicId: 302201
|
||
|
|
dashedName: problem-87-prime-power-triples
|
||
|
|
---
|
||
|
|
|
||
|
|
# --description--
|
||
|
|
|
||
|
|
The smallest number expressible as the sum of a prime square, prime cube, and prime fourth power is 28. In fact, there are exactly four numbers below fifty that can be expressed in such a way:
|
||
|
|
|
||
|
|
<div style='margin-left: 4em;'>
|
||
|
|
28 = 2<sup>2</sup> + 2<sup>3</sup> + 2<sup>4</sup><br>
|
||
|
|
33 = 3<sup>2</sup> + 2<sup>3</sup> + 2<sup>4</sup><br>
|
||
|
|
49 = 5<sup>2</sup> + 2<sup>3</sup> + 2<sup>4</sup><br>
|
||
|
|
47 = 2<sup>2</sup> + 3<sup>3</sup> + 2<sup>4</sup>
|
||
|
|
</div>
|
||
|
|
|
||
|
|
How many numbers below fifty million can be expressed as the sum of a prime square, prime cube, and prime fourth power?
|
||
|
|
|
||
|
|
# --hints--
|
||
|
|
|
||
|
|
`primePowerTriples()` should return a number.
|
||
|
|
|
||
|
|
```js
|
||
|
|
assert(typeof primePowerTriples() === 'number');
|
||
|
|
```
|
||
|
|
|
||
|
|
`primePowerTriples()` should return 1097343.
|
||
|
|
|
||
|
|
```js
|
||
|
|
assert.strictEqual(primePowerTriples(), 1097343);
|
||
|
|
```
|
||
|
|
|
||
|
|
# --seed--
|
||
|
|
|
||
|
|
## --seed-contents--
|
||
|
|
|
||
|
|
```js
|
||
|
|
function primePowerTriples() {
|
||
|
|
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
primePowerTriples();
|
||
|
|
```
|
||
|
|
|
||
|
|
# --solutions--
|
||
|
|
|
||
|
|
```js
|
||
|
|
// solution required
|
||
|
|
```
|