This website is a semi-functional mirror of the original Project Euler. More information is available on GitHub.
projecteuler.net

Diophantine reciprocals III

Problem 454

Published on 11 January 2014 at 07:00 pm [Server Time]

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).


Answer:
Go to back to Problems