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

id, challengeType, title

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

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?

Instructions

Tests

tests:
  - text: <code>euler131()</code> should return 173.
    testString: assert.strictEqual(euler131(), 173, '<code>euler131()</code> should return 173.');

Challenge Seed

function euler131() {
  // Good luck!
  return true;
}

euler131();

Solution

// solution required