7907f62337
* fix: clean-up Project Euler 121-140 * fix: corrections from review Co-authored-by: Sem Bauke <46919888+Sembauke@users.noreply.github.com> * fix: missing backticks Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com> * fix: corrections from review Co-authored-by: Tom <20648924+moT01@users.noreply.github.com> * fix: missing delimiter Co-authored-by: Sem Bauke <46919888+Sembauke@users.noreply.github.com> Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com> Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
900 B
900 B
id, title, challengeType, forumTopicId, dashedName
| id | title | challengeType | forumTopicId | dashedName |
|---|---|---|---|---|
| 5900f3ef1000cf542c50ff02 | Problem 131: Prime cube partnership | 5 | 301759 | problem-131-prime-cube-partnership |
--description--
There are some prime values, p, for which there exists a positive integer, n, such that the expression n^3 + n^{2}p is a perfect cube.
For example, when p = 19,\\ 8^3 + 8^2 × 19 = {12}^3.
What is perhaps most surprising is that the value of n is unique for each prime with this property, and there are only four such primes below one hundred.
How many primes below one million have this remarkable property?
--hints--
primeCubePartnership() should return 173.
assert.strictEqual(primeCubePartnership(), 173);
--seed--
--seed-contents--
function primeCubePartnership() {
return true;
}
primeCubePartnership();
--solutions--
// solution required