Oliver Eyton-Williams 0bd52f8bd1
Feat: add new Markdown parser (#39800)
and change all the challenges to new `md` format.
2020-11-27 10:02:05 -08:00

660 B

id, title, challengeType, forumTopicId
id title challengeType forumTopicId
5900f5331000cf542c510045 Problem 454: Diophantine reciprocals III 5 302127

--description--

In the following equation x, y, and n are positive integers. 1/x + 1/y= 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(1012).

--hints--

euler454() should return 5435004633092.

assert.strictEqual(euler454(), 5435004633092);

--seed--

--seed-contents--

function euler454() {

  return true;
}

euler454();

--solutions--

// solution required