2018-10-08 17:51:51 +00:00
---
2018-10-10 20:20:40 +00:00
id: 5900f5331000cf542c510045
2018-10-08 17:51:51 +00:00
challengeType: 5
title: 'Problem 454: Diophantine reciprocals III'
2018-10-10 20:20:40 +00:00
videoUrl: ''
localeTitle: 'Problema 454: Recíprocos diofánticos III'
2018-10-08 17:51:51 +00:00
---
## Description
2018-10-10 20:20:40 +00:00
< section id = "description" > En la siguiente ecuación, x, y y n son enteros positivos. < p > 1x + 1y = 1n < / p > < p > Para un límite L definimos F (L) como el número de soluciones que satisfacen x < y ≤ L. < / p > < p > Podemos verificar que F (15) = 4 y F (1000) = 1069. Encuentre F (1012). < / p > < / section >
2018-10-08 17:51:51 +00:00
## Instructions
2018-10-10 20:20:40 +00:00
< section id = "instructions" >
2018-10-08 17:51:51 +00:00
< / section >
## Tests
< section id = 'tests' >
```yml
tests:
- text: < code > euler454()</ code > debe devolver 5435004633092.
testString: 'assert.strictEqual(euler454(), 5435004633092, "< code > euler454()< / code > should return 5435004633092.");'
```
< / section >
## Challenge Seed
< section id = 'challengeSeed' >
< div id = 'js-seed' >
```js
function euler454() {
// Good luck!
return true;
}
euler454();
2018-10-10 20:20:40 +00:00
2018-10-08 17:51:51 +00:00
```
< / div >
< / section >
## Solution
< section id = 'solution' >
```js
// solution required
```
< / section >