My guess:
Quote from sage documentation:
"Warning The current implementation splits the modulus into prime
powers, then"...
so 1 is considered a bad input.
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)
Maor
On Aug 2, 1:29 pm, Johannes <dajo.m...@web.de> wrote:
> Hi list,
> i just tried to solve a very simple congruences with solve_mod:
>
> x = var('x')
> eq = x + 1 == 0
> res = solve_mod(eq,1)
> res == [()]
> true
>
> but in my eyes every x \in ZZ should be a valid solution. I'm just
> interested in the minimal one.
> On the otherside, in my case I cannot guaranty that the modulus is always 1.
>
> Any ideas or solutions?
>
> 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
