Solving the diophantine equation ax2 + bxy + cy2 + dx + ey +f = 0, where not all of a, b and c are zero.

See the note for an outline of the algorithm used. A novel feature is the use of a theorem of John Robertson in the case b2 - 4ac > 0 and nonsquare and where not both d and e are zero.

The output should be equivalent to that of the Sawilla, Silvester, Williams program.

This is a BCMath version of BC function sswgeneral(a,b,c,d,e,f) contained in patz.

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

Last modified 7th May 2015
Return to main page