22afc2a0ca
Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com> Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com> Co-authored-by: Beau Carnes <beaucarnes@gmail.com>
942 B
942 B
id, challengeType, isHidden, title, forumTopicId
| id | challengeType | isHidden | title | forumTopicId |
|---|---|---|---|---|
| 5900f5331000cf542c510045 | 5 | false | Problem 454: Diophantine reciprocals III | 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).
Instructions
Tests
tests:
- text: <code>euler454()</code> should return 5435004633092.
testString: assert.strictEqual(euler454(), 5435004633092);
Challenge Seed
function euler454() {
// Good luck!
return true;
}
euler454();
Solution
// solution required