63 lines
1.1 KiB
Markdown
63 lines
1.1 KiB
Markdown
|
---
|
||
|
|
id: 5
|
||
|
|
localeTitle: 5900f47e1000cf542c50ff90
|
||
|
|
challengeType: 5
|
||
|
|
title: 'Problem 273: Sum of Squares'
|
||
|
|
---
|
||
|
|
|
||
|
|
## Description
|
||
|
|
<section id='description'>
|
||
|
|
Considera las ecuaciones de la forma: a2 + b2 = N, 0 ≤ a ≤ b, a, by N entero.
|
||
|
|
|
||
|
|
Para N = 65 hay dos soluciones:
|
||
|
|
a = 1, b = 8 y a = 4, b = 7.
|
||
|
|
Llamamos a S (N) la suma de los valores de a de todas las soluciones de a2 + b2 = N, 0 ≤ a ≤ b, a, by N entero.
|
||
|
|
Así, S (65) = 1 + 4 = 5.
|
||
|
|
Encuentre FindS (N), para todos los cuadrados libres N solo divisibles por números primos de la forma 4k + 1 con 4k + 1 <150.
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Instructions
|
||
|
|
<section id='instructions'>
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Tests
|
||
|
|
<section id='tests'>
|
||
|
|
|
||
|
|
```yml
|
||
|
|
tests:
|
||
|
|
- text: <code>euler273()</code> debe devolver 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>
|