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

1.1 KiB

id title challengeType forumTopicId dashedName
5900f3c51000cf542c50fed8 Problem 87: Prime power triples 5 302201 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:

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?

--hints--

primePowerTriples() should return a number.

assert(typeof primePowerTriples() === 'number');

primePowerTriples() should return 1097343.

assert.strictEqual(primePowerTriples(), 1097343);

--seed--

--seed-contents--

function primePowerTriples() {

  return true;
}

primePowerTriples();

--solutions--

// solution required