66 lines
1.2 KiB
Markdown
66 lines
1.2 KiB
Markdown
|
---
|
||
|
|
id: 5
|
||
|
|
localeTitle: 5900f4711000cf542c50ff84
|
||
|
|
challengeType: 5
|
||
|
|
title: 'Problem 261: Pivotal Square Sums'
|
||
|
|
---
|
||
|
|
|
||
|
|
## Description
|
||
|
|
<section id='description'>
|
||
|
|
Llamemos a un entero positivo ka cuadrado-pivote, si hay un par de enteros m> 0 y n ≥ k, de modo que la suma de los cuadrados consecutivos (m + 1) hasta k sea igual a la suma de m consecutivos cuadrados de (n + 1) en:
|
||
|
|
|
||
|
|
(km) 2 + ... + k2 = (n + 1) 2 + ... + (n + m) 2.
|
||
|
|
|
||
|
|
Algunos pequeños pivotes cuadrados son
|
||
|
|
4: 32 + 42
|
||
|
|
= 52
|
||
|
|
21: 202 + 212 = 292
|
||
|
|
24: 212 + 222 + 232 + 242 = 252 + 262 + 272
|
||
|
|
110: 1082 + 1092 + 1102 = 1332 + 1342Encuentre la suma de todos los distintos pivotes cuadrados ≤ 1010.
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Instructions
|
||
|
|
<section id='instructions'>
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Tests
|
||
|
|
<section id='tests'>
|
||
|
|
|
||
|
|
```yml
|
||
|
|
tests:
|
||
|
|
- text: <code>euler261()</code> debe devolver 238890850232021.
|
||
|
|
testString: 'assert.strictEqual(euler261(), 238890850232021, "<code>euler261()</code> should return 238890850232021.");'
|
||
|
|
|
||
|
|
```
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Challenge Seed
|
||
|
|
<section id='challengeSeed'>
|
||
|
|
|
||
|
|
<div id='js-seed'>
|
||
|
|
|
||
|
|
```js
|
||
|
|
function euler261() {
|
||
|
|
// Good luck!
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
euler261();
|
||
|
|
```
|
||
|
|
|
||
|
|
</div>
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Solution
|
||
|
|
<section id='solution'>
|
||
|
|
|
||
|
|
```js
|
||
|
|
// solution required
|
||
|
|
```
|
||
|
|
</section>
|