Files
freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-46-goldbachs-other-conjecture.md

22 lines
646 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: 5900f39a1000cf542c50fead
title: 问题46哥德巴赫的另一个猜想
challengeType: 5
videoUrl: ''
---
# --description--
由Christian Goldbach提出每个奇数的复合数可以写成素数和两个平方的总和。 9 = 7 + 2×1 <sup>2</sup> 15 = 7 + 2×2 <sup>2</sup> 21 = 3 + 2×3 <sup>2</sup> 25 = 7 + 2×3 <sup>2</sup> 27 = 19 + 2×2 <sup>2</sup> 33 = 31 + 2×1 <sup>2</sup>转这个猜想是假的。什么是最小的奇数复合,不能写为素数和两倍平方的总和?
# --hints--
`goldbachsOtherConjecture()`应返回5777。
```js
assert.strictEqual(goldbachsOtherConjecture(), 5777);
```
# --solutions--