Solving the diophantine equation ax2 + bxy + cy2 + dx + ey +f = 0, where b2 - 4ac > 0 is not a perfect square.


This is an implementation of an algorithm in the recent paper:

On solving a binary quadratic diophantine equation, K.R. Matthews, J.P. Robertson, Rocky Mountain Journal of Mathematics, 51(4): 1369-1385 (August 2021). See outline of algorithm.

Enter a:
Enter b:
Enter c:
Enter d:
Enter e:
Enter f:

Last modified 17th September 2021
Return to main page