freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-87-prime-power-triples.md

id	challengeType	title	forumTopicId
5900f3c51000cf542c50fed8	5	Problem 87: Prime power triples	302201

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 = 2² + 2³ + 2⁴
33 = 3² + 2³ + 2⁴
49 = 5² + 2³ + 2⁴
47 = 2² + 3³ + 2⁴

How many numbers below fifty million can be expressed as the sum of a prime square, prime cube, and prime fourth power?

Instructions

Tests

tests:
  - text: <code>primePowerTriples()</code> should return a number.
    testString: assert(typeof primePowerTriples() === 'number');
  - text: <code>primePowerTriples()</code> should return 1097343.
    testString: assert.strictEqual(primePowerTriples(), 1097343);

Challenge Seed

function primePowerTriples() {

  return true;
}

primePowerTriples();

Solution

// solution required