936 B
936 B
id | challengeType | title |
---|---|---|
5900f5331000cf542c510045 | 5 | Problem 454: Diophantine reciprocals III |
Description
1x + 1y
1n
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, "<code>euler454()</code> should return 5435004633092.");'
Challenge Seed
function euler454() {
// Good luck!
return true;
}
euler454();
Solution
// solution required