Diophantine reciprocals III

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

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

Written by gamwe6 who lives and works in San Francisco building useful things. You should follow him on Twitter