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

45 lines
792 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: '问题 131立方伙伴素数'
challengeType: 5
forumTopicId: 301759
dashedName: problem-131-prime-cube-partnership
---
# --description--
存在一些素数 $p$,使得存在正整数 $n$,让算式 $n^3 + n^{2}p$ 得到一个立方数。
例如当 $p = 19,\\ 8^3 + 8^2 × 19 = {12}^3$。
最奇特的是 $n$ 的值对于这个素数具有唯一性100 以内只有四个这种素数。
一百万以下的素数有多少具有这种非凡特性?
# --hints--
`primeCubePartnership()` 应该返回 `173`
```js
assert.strictEqual(primeCubePartnership(), 173);
```
# --seed--
## --seed-contents--
```js
function primeCubePartnership() {
return true;
}
primeCubePartnership();
```
# --solutions--
```js
// solution required
```