#13629: provide xgcd for new polynomial rings through
_xgcd_univariate_polynomial
-------------------------------------+-------------------------------------
Reporter: saraedum | Owner: AlexGhitza
Type: task | Status: needs_work
Priority: minor | Milestone: sage-6.4
Component: basic arithmetic | Resolution:
Keywords: sd59 | Merged in:
Authors: Julian Rueth | Reviewers: Peter Bruin
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/pbruin/13629-xgcd_univariate_polynomial|
828b5fc1a62567b98e35167cf686c59340b521f6
Dependencies: #13628, #18461, | Stopgaps:
#18467 |
-------------------------------------+-------------------------------------
Changes (by bruno):
* status: needs_review => needs_work
Comment:
The current branch does not pass the tests. The failed test is in
`src/sage/rings/ring.pyx`, lines 2196-2203:
{{{#!python
sage: for A in (RR, CC, QQbar):
....: g = A._gcd_univariate_polynomial
....: R.<x> = A[]
....: z = R.zero()
....: assert(g(2*x, 2*x^2) == x and
....: g(z, 2*x) == x and
....: g(2*x, z) == x and
....: g(z, z) == z)
}}}
More precisely, I've got the following severe bug:
{{{#!python
sage: R.<x> = RR[]
sage: z, h = R(0), R(1/2)
sage: (xx, hh, zz) = RR._xgcd_univariate_polynomial(2*x, 2*x^2)
sage: zz == z
False
sage: zz-z
BOOOM! (SegFault)
}}}
The crash log is empty.
--
Ticket URL: <http://trac.sagemath.org/ticket/13629#comment:30>
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.
For more options, visit https://groups.google.com/d/optout.
