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

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

## Description
<section id="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>转这个猜想是假的。什么是最小的奇数复合，不能写为素数和两倍平方的总和？ </section>

## Instructions
<section id="instructions">
</section>

## Tests
<section id='tests'>

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

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

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

goldbachsOtherConjecture();

```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```

/section>