# project-euler/108/euler-108.pl

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

+For n = 4 there are exactly three distinct solutions:

+What is the least value of n for which the number of distinct solutions exceeds one-thousand?

+1/y = 1/n-1/x = (x-n)/nx

+y = n*(t+n) / t = n + [ n^2 / t ]

+# use Math::GMP ':constant';

+for (my $n = 1_000; ;$n++)

+ print "Reached $n [$count]\n";