60 lines
1.1 KiB
Markdown
60 lines
1.1 KiB
Markdown
|
---
|
||
|
|
id: 5
|
||
|
|
localeTitle: 5900f3f51000cf542c50ff07
|
||
|
|
challengeType: 5
|
||
|
|
title: 'Problem 136: Singleton difference'
|
||
|
|
---
|
||
|
|
|
||
|
|
## Description
|
||
|
|
<section id='description'>
|
||
|
|
Los enteros positivos, x, y, y z, son términos consecutivos de una progresión aritmética. Dado que n es un entero positivo, la ecuación, x2 - y2 - z2 = n, tiene exactamente una solución cuando n = 20:
|
||
|
|
132 - 102 - 72 = 20
|
||
|
|
De hecho, hay veinticinco valores de n por debajo de cien Para lo cual la ecuación tiene una solución única.
|
||
|
|
¿Cuántos valores de n menos de cincuenta millones tienen exactamente una solución?
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Instructions
|
||
|
|
<section id='instructions'>
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Tests
|
||
|
|
<section id='tests'>
|
||
|
|
|
||
|
|
```yml
|
||
|
|
tests:
|
||
|
|
- text: <code>euler136()</code> debe devolver 2544559.
|
||
|
|
testString: 'assert.strictEqual(euler136(), 2544559, "<code>euler136()</code> should return 2544559.");'
|
||
|
|
|
||
|
|
```
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Challenge Seed
|
||
|
|
<section id='challengeSeed'>
|
||
|
|
|
||
|
|
<div id='js-seed'>
|
||
|
|
|
||
|
|
```js
|
||
|
|
function euler136() {
|
||
|
|
// Good luck!
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
euler136();
|
||
|
|
```
|
||
|
|
|
||
|
|
</div>
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Solution
|
||
|
|
<section id='solution'>
|
||
|
|
|
||
|
|
```js
|
||
|
|
// solution required
|
||
|
|
```
|
||
|
|
</section>
|