freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-131-prime-cube-partnership.md

id, title, challengeType, forumTopicId

id	title	challengeType	forumTopicId
5900f3ef1000cf542c50ff02	Problem 131: Prime cube partnership	5	301759

--description--

There are some prime values, p, for which there exists a positive integer, n, such that the expression n3 + n2p is a perfect cube.

For example, when p = 19, 83 + 82×19 = 123.

What is perhaps most surprising is that for each prime with this property the value of n is unique, and there are only four such primes below one-hundred.

How many primes below one million have this remarkable property?

--hints--

euler131() should return 173.

assert.strictEqual(euler131(), 173);

--seed--

--seed-contents--

function euler131() {

  return true;
}

euler131();

--solutions--

// solution required