Files
freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-87-prime-power-triples.chinese.md
Oliver Eyton-Williams 61460c8601 fix: insert blank line after ```
search and replace ```\n< with ```\n\n< to ensure there's an empty line
before closing tags
2020-08-16 04:45:20 +05:30

996 B
Raw Blame History

id, challengeType, title, videoUrl, localeTitle
id challengeType title videoUrl localeTitle
5900f3c51000cf542c50fed8 5 Problem 87: Prime power triples 问题87Prime power三倍

Description

可表示为素数平方素数立方和素数四次幂之和的最小数是28.事实上正好有四个数字低于五十可以用这样的方式表示28 = 22 + 23 + 24 33 = 32 + 23 + 24 49 = 52 + 23 + 24 47 = 22 + 33 + 24五千万以下的数字可以表示为素数素数和素数四次幂之和

Instructions

Tests

tests:
  - text: <code>euler87()</code>应该返回1097343。
    testString: assert.strictEqual(euler87(), 1097343);

Challenge Seed

function euler87() {
  // Good luck!
  return true;
}

euler87();

Solution

// solution required

/section>