freeCodeCamp/curriculum/challenges/spanish/08-coding-interview-prep/project-euler/problem-454-diophantine-reciprocals-iii.spanish.md

---
id: 5
localeTitle: 5900f5331000cf542c510045
challengeType: 5
title: 'Problem 454: Diophantine reciprocals III'
---

## Description
<section id='description'> 
En la siguiente ecuación x, y yn son enteros positivos. 

1x 
+ 
1y 
= 
1n 

Para un límite L definimos F (L) como el número de soluciones que satisfacen x &lt;y ≤ L. 

Podemos verificar que F (15) = 4 y F (1000) = 1069. 
Encuentra F (1012). 
</section>

## Instructions
<section id='instructions'> 

</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();
```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```
</section>