freeCodeCamp/curriculum/challenges/08-coding-interview-prep/project-euler/Problem 87: Prime power triples.md

---
id: 5900f3c51000cf542c50fed8
challengeType: 5
title: 'Problem 87: Prime power triples'
---

## Description
<section id='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:
28 = 22 + 23 + 24
33 = 32 + 23 + 24
49 = 52 + 23 + 24
47 = 22 + 33 + 24
How many numbers below fifty million can be expressed as the sum of a prime square, prime cube, and prime fourth power?
</section>

## Instructions
<section id='instructions'>

</section>

## Tests
<section id='tests'>

```yml
- text: <code>euler87()</code> should return 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>