yaworsw/euler-manager

---
:id: 108
:name: Diophantine reciprocals I
:url: https://projecteuler.net/problem=108
:content: "In the following equation <var>x</var>, <var>y</var>, and <var>n</var>
  are positive integers.\n\n| \n1  \n<var>x</var>\n | + | \n1  \n<var>y</var>\n |
  = | \n1  \n<var>n</var>\n |\n\nFor <var>n</var> = 4 there are exactly three distinct
  solutions:\n\n| \n1  \n5\n | + | \n1  \n20\n | = | \n1  \n4\n |\n| \n1  \n6\n |
  + | \n1  \n12\n | = | \n1  \n4\n |\n| \n1  \n8\n | + | \n1  \n8\n | = | \n1  \n4\n
  |\n\nWhat is the least value of <var>n</var> for which the number of distinct solutions
  exceeds one-thousand?\n\nNOTE: This problem is an easier version of [Problem 110](problem=110);
  it is strongly advised that you solve this one first.\n\n"