Files
freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-131-prime-cube-partnership.md
Oliver Eyton-Williams ee1e8abd87 feat(curriculum): restore seed + solution to Chinese (#40683)
* feat(tools): add seed/solution restore script

* chore(curriculum): remove empty sections' markers

* chore(curriculum): add seed + solution to Chinese

* chore: remove old formatter

* fix: update getChallenges

parse translated challenges separately, without reference to the source

* chore(curriculum): add dashedName to English

* chore(curriculum): add dashedName to Chinese

* refactor: remove unused challenge property 'name'

* fix: relax dashedName requirement

* fix: stray tag

Remove stray `pre` tag from challenge file.

Signed-off-by: nhcarrigan <nhcarrigan@gmail.com>

Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
2021-01-12 19:31:00 -07:00

750 B
Raw Blame History

id, title, challengeType, videoUrl, dashedName
id title challengeType videoUrl dashedName
5900f3ef1000cf542c50ff02 问题131Prime立方体伙伴关系 5 problem-131-prime-cube-partnership

--description--

存在一些素数值p其中存在正整数n使得表达式n3 + n2p是完美的立方体。例如当p = 19时83 + 82×19 = 123.最令人惊讶的是对于具有此属性的每个素数n的值是唯一的并且在100之下只有四个这样的素数。一百万以下的素数有多少这个非凡的财产

--hints--

euler131()应该返回173。

assert.strictEqual(euler131(), 173);

--seed--

--seed-contents--

function euler131() {

  return true;
}

euler131();

--solutions--

// solution required