Files
gikf 7907f62337 fix(curriculum): clean-up Project Euler 121-140 (#42731)
* 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>
2021-07-16 21:38:37 +02:00

45 lines
900 B
Markdown
Raw Permalink Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

---
id: 5900f3ef1000cf542c50ff02
title: 'Problem 131: Prime cube partnership'
challengeType: 5
forumTopicId: 301759
dashedName: 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`.
```js
assert.strictEqual(primeCubePartnership(), 173);
```
# --seed--
## --seed-contents--
```js
function primeCubePartnership() {
return true;
}
primeCubePartnership();
```
# --solutions--
```js
// solution required
```