On Aug 2, 10:16 am, Johannes <dajo.m...@web.de> wrote: > Am 02.08.2011 15:36, schrieb Maor:> My guess: > > Quote from sage documentation: > > "Warning The current implementation splits the modulus into prime > > powers, then"... > > > so 1 is considered a bad input. > > this should be a two line fix i think. > somethink like: > if modul == 1: > return 0 > > > Also - there is only 0 in mod(1), so even if it worked - you would get > > 0. (the results are in Z_n not Z). > > thats even better in my case. i was wondering how sage handles infinite > resultsets in this case.
I think that mod n you can only have finitely many answers :) More seriously, we would welcome any work on solve_mod that people care to contribute. There have been some great improvements of late, but it is still pretty naive. Maybe someone can rebase and review http://trac.sagemath.org/sage_trac/ticket/11036, for instance... That patch includes fixing the modulus=1 situation discussed in this thread, incidentally. - kcrisman -- 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
