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

---
id: 5900f3ef1000cf542c50ff02
title: 'Problem 131: Prime cube partnership'
challengeType: 5
forumTopicId: 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.

```js
assert.strictEqual(euler131(), 173);
```

# --seed--

## --seed-contents--

```js
function euler131() {

  return true;
}

euler131();
```

# --solutions--

```js
// solution required
```
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 23:01:58 +01:00
+								---
 								id: 5900f3ef1000cf542c50ff02
 								title: 'Problem 131: Prime cube partnership'
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 19:02:05 +01:00
+								challengeType: 5
-												fix(curriculum): Added forumTopicId to remaining 1200 challeng… (#36558)


											
										
										
											2019-08-05 09:17:33 -07:00
+								forumTopicId: 301759
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 23:01:58 +01:00
+								---
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 19:02:05 +01:00
+								# --description--
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 23:01:58 +01:00
+								There are some prime values, p, for which there exists a positive integer, n, such that the expression n3 + n2p is a perfect cube.
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 19:02:05 +01:00
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 23:01:58 +01:00
+								For example, when p = 19, 83 + 82×19 = 123.
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 19:02:05 +01:00
+								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.
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 23:01:58 +01:00
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 19:02:05 +01:00
+								How many primes below one million have this remarkable property?
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 23:01:58 +01:00
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 19:02:05 +01:00
+								# --hints--
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 23:01:58 +01:00
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 19:02:05 +01:00
+								`euler131()` should return 173.
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 23:01:58 +01:00
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 19:02:05 +01:00
+								```js
 								assert.strictEqual(euler131(), 173);
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 23:01:58 +01:00
+								```
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 19:02:05 +01:00
+								# --seed--
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 23:01:58 +01:00
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 19:02:05 +01:00
+								## --seed-contents--
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 23:01:58 +01:00
 								```js
 								function euler131() {
-												fix: remove Good luck! comment from challenge seed code (#39575)


											
										
										
											2020-09-15 09:57:40 -07:00
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 23:01:58 +01:00
+								  return true;
 								}
 								euler131();
 								```
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 19:02:05 +01:00
+								# --solutions--
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 23:01:58 +01:00
 								```js
 								// solution required
 								```