56 lines
1.3 KiB
Markdown
56 lines
1.3 KiB
Markdown
|
---
|
|||
|
|
id: 5900f4521000cf542c50ff64
|
|||
|
|
challengeType: 5
|
|||
|
|
title: 'Problem 229: Four Representations using Squares'
|
|||
|
|
videoUrl: ''
|
|||
|
|
localeTitle: 问题229：使用正方形的四个表示
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
## Description
|
|||
|
|
<section id="description">考虑数字3600.这是非常特别的，因为<p> 3600 = 482 + 362 3600 = 202 + 2×402 3600 = 302 + 3×302 3600 = 452 + 7×152 </p><p>类似地，我们发现88201 = 992 + 2802 = 2872 + 2×542 = 2832 + 3×522 = 1972 + 7×842。 </p><p>在1747年，欧拉证明哪些数字可以表示为两个正方形的总和。我们感兴趣的是数字n，它承认以下四种类型的表示： </p><p> n = a12 + b12n = a22 + 2 b22n = a32 + 3 b32n = a72 + 7 b72， </p><p>其中ak和bk是正整数。 </p><p>有75373这样的数字不超过107。 </p><p>有多少这样的数字不超过2×109？ </p></section>
|
|||
|
|
|
|||
|
|
## Instructions
|
|||
|
|
<section id="instructions">
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Tests
|
|||
|
|
<section id='tests'>
|
|||
|
|
|
|||
|
|
```yml
|
|||
|
|
tests:
|
|||
|
|
- text: <code>euler229()</code>应该返回11325263。
|
|||
|
|
testString: 'assert.strictEqual(euler229(), 11325263, "<code>euler229()</code> should return 11325263.");'
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Challenge Seed
|
|||
|
|
<section id='challengeSeed'>
|
|||
|
|
|
|||
|
|
<div id='js-seed'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
function euler229() {
|
|||
|
|
// Good luck!
|
|||
|
|
return true;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
euler229();
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Solution
|
|||
|
|
<section id='solution'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
// solution required
|
|||
|
|
```
|
|||
|
|
</section>
|