Files
freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-46-goldbachs-other-conjecture.md
Oliver Eyton-Williams dec409a4bd fix: s/localeTitle/title/g
2020-10-06 23:10:08 +05:30

1.0 KiB
Raw Blame History

id, challengeType, videoUrl, title
id challengeType videoUrl title
5900f39a1000cf542c50fead 5 问题46哥德巴赫的另一个猜想

Description

由Christian Goldbach提出每个奇数的复合数可以写成素数和两个平方的总和。 9 = 7 + 2×1 2 15 = 7 + 2×2 2 21 = 3 + 2×3 2 25 = 7 + 2×3 2 27 = 19 + 2×2 2 33 = 31 + 2×1 2转这个猜想是假的。什么是最小的奇数复合,不能写为素数和两倍平方的总和?

Instructions

Tests

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

Challenge Seed

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

goldbachsOtherConjecture();

Solution

// solution required

/section>