61 lines
1.0 KiB
Markdown
61 lines
1.0 KiB
Markdown
---
|
||
id: 5900f3ef1000cf542c50ff02
|
||
challengeType: 5
|
||
title: 'Problem 131: Prime cube partnership'
|
||
forumTopicId: 301759
|
||
---
|
||
|
||
## Description
|
||
<section id='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?
|
||
</section>
|
||
|
||
## Instructions
|
||
<section id='instructions'>
|
||
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler131()</code> should return 173.
|
||
testString: assert.strictEqual(euler131(), 173);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler131() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler131();
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
</section>
|