Ask Your Question

Revision history [back]

click to hide/show revision 1
initial version

Solving ax^2+bxy+cy^2=n fast?

Hi, I was wondering whether equations as ax^2+bxy+cy^2=n can be solved fast. Solve is a general application with overhead. I think of methods such as can be found on by Dario Alejandro Alpern, or by Keith Matthews. It seems to me logic that for instance BinaryQF would facilitate this within Sage.

I wrote some routines using Python (like NZMATH cornacchiamodify, but these have to be optimized via Cython and GMP. Another source is the LMM algorithm. Before I take this route, I want to check that I'm not reinventing the wheel and/or I'm able to cooperate with someone.

Thanks in advance for your guidance! Roland