#14155: gcd for IntegerMod
------------------------------------+---------------------------------------
Reporter: roed | Owner: AlexGhitza
Type: defect | Status: needs_review
Priority: major | Milestone: sage-5.8
Component: basic arithmetic | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: | Merged in:
Dependencies: | Stopgaps:
------------------------------------+---------------------------------------
Changes (by roed):
* status: needs_work => needs_review
Comment:
I think that these changes are okay:
{{{
File
"/mnt/storage2TB/patchbot/Sage/sage-5.7.rc0/devel/sage-14155/sage/symbolic/expression.pyx",
line 2804:
sage: (Mod(2,7)*x^2 + Mod(2,7))^7
Expected:
128*(x^2 + 1)^7
Got:
(2*x^2 + 2)^7
**********************************************************************
File
"/mnt/storage2TB/patchbot/Sage/sage-5.7.rc0/devel/sage-14155/sage/symbolic/expression.pyx",
line 2809:
sage: t = Mod(2,7); gcd(t, t)^7
Expected:
128
Got:
1
**********************************************************************
File
"/mnt/storage2TB/patchbot/Sage/sage-5.7.rc0/devel/sage-14155/sage/symbolic/expression.pyx",
line 2811:
sage: gcd(t,t).parent()
Expected:
Integer Ring
Got:
Ring of integers modulo 7
}}}
It would be a bit nicer to get `2*(x^2 + 1)^7` in the first case, but I
think that would require a change to GiNaC.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14155#comment:4>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
