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

22 lines
574 B
Markdown
Raw 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: 问题131Prime立方体伙伴关系
challengeType: 5
videoUrl: ''
---
# --description--
存在一些素数值p其中存在正整数n使得表达式n3 + n2p是完美的立方体。例如当p = 19时83 + 82×19 = 123.最令人惊讶的是对于具有此属性的每个素数n的值是唯一的并且在100之下只有四个这样的素数。一百万以下的素数有多少这个非凡的财产
# --hints--
`euler131()`应该返回173。
```js
assert.strictEqual(euler131(), 173);
```
# --solutions--