56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
|
---
|
|||
|
|
id: 5900f47e1000cf542c50ff90
|
|||
|
|
challengeType: 5
|
|||
|
|
title: 'Problem 273: Sum of Squares'
|
|||
|
|
videoUrl: ''
|
|||
|
|
localeTitle: 问题273：正方形的总和
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
## Description
|
|||
|
|
<section id="description">考虑以下形式的方程：a2 + b2 = N，0≤a≤b，a，b和N整数。 <p>对于N = 65，有两种解决方案：a = 1，b = 8，a = 4，b = 7。我们将S（N）称为a2 + b2 = N，0≤a≤b，a，b和N整数的所有解的a的值之和。因此，S（65）= 1 + 4 = 5.找到ΣS（N），对于所有无平均N，只能被4k + 1形式的素数整除，其中4k + 1 <150。 </p></section>
|
|||
|
|
|
|||
|
|
## Instructions
|
|||
|
|
<section id="instructions">
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Tests
|
|||
|
|
<section id='tests'>
|
|||
|
|
|
|||
|
|
```yml
|
|||
|
|
tests:
|
|||
|
|
- text: <code>euler273()</code>应该返回2032447591196869000。
|
|||
|
|
testString: 'assert.strictEqual(euler273(), 2032447591196869000, "<code>euler273()</code> should return 2032447591196869000.");'
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Challenge Seed
|
|||
|
|
<section id='challengeSeed'>
|
|||
|
|
|
|||
|
|
<div id='js-seed'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
function euler273() {
|
|||
|
|
// Good luck!
|
|||
|
|
return true;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
euler273();
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Solution
|
|||
|
|
<section id='solution'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
// solution required
|
|||
|
|
```
|
|||
|
|
</section>
|