Hi, I was wondering whether equations as ax^2+bxy+cy^2=n can be solved fast. Solve is a general application with a lot of overhead. I think of methods such as can be found on www.alpertron.com.ar/METHODS.HTM by Dario Alejandro Alpern, or www.numbertheory.org/php/ by Keith Matthews. It seems to me logic that for instance BinaryQF would facilitate this. N.B.: To fully understand the concept, I wrote my some routines but these have to be optimized via Cython and in particular using mpz. Before I take this route, I want to check that I'm not reinventing the wheel. Thanks in advance for your guidance! Roland
-- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
