Finding the fundamental primitive solutions of the diophantine equation ax2+bxy+cy2=n, where d=b2-4ac > 0 and is not a perfect square and (√d)/2 > |n|.
The algorithm is sketched in a paper by Keith Matthews, Anitha Srinivasan and John Robertson and is a BCMath version of a BC program.
E = 1 is verbose.