1 | initial version |
Hi,
The case of the sum of squares (a=c=1 and b=0) has been implemented recently in trac ticket #16308. It uses factorisation of integers and Cornacchia's algorithm (as well as a small a naive method for small input but implemented in C).
I agree with Ralf it would be nice to have more general method for quadratic diophantine equations!
Vincent
2 | No.2 Revision |
Hi,
The case of the sum of squares (a=c=1 and b=0) has been implemented recently in trac ticket #16308. It uses factorisation of integers and Cornacchia's algorithm (as well as a small a naive method for small input but implemented in C).
I agree with Ralf it would be nice to have more general method for quadratic diophantine equations!
Vincent