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.
greatz Johannes
--
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
