Back to Freecodecamp

Problem 454: Diophantine reciprocals III

curriculum/challenges/english/blocks/project-euler-problems-401-to-480/5900f5331000cf542c510045.md

latest638 B
Original Source

--description--

In the following equation $x$, $y$, and $n$ are positive integers.

$$\frac{1}{x} + \frac{1}{y} = \frac{1}{n}$$

For a limit $L$ we define $F(L)$ as the number of solutions which satisfy $x < y ≤ L$.

We can verify that $F(15) = 4$ and $F(1000) = 1069$.

Find $F({10}^{12})$.

--hints--

diophantineReciprocalsThree() should return 5435004633092.

js
assert.strictEqual(diophantineReciprocalsThree(), 5435004633092);

--seed--

--seed-contents--

js
function diophantineReciprocalsThree() {

  return true;
}

diophantineReciprocalsThree();

--solutions--

js
// solution required