#8111: gcd of rationals is trouble
--------------------------------+-------------------------------------------
Reporter: pdehaye | Owner: AlexGhitza
Type: defect | Status: new
Priority: major | Milestone: sage-4.3.2
Component: basic arithmetic | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
--------------------------------+-------------------------------------------
The GCD of rationals is still unclear (see trac 3214), and leads to
definite problems with reduce().
{{{
K.<k>= QQ[];
print gcd(64,256)
print gcd(K(64),K(256))
print gcd(64*k^2+128,64*k^3+256)
frac = (64*k^2+128)/(64*k^3+256)
frac.reduce()
print frac
}}}
gives
{{{
64
1
1
(64*k^2 + 128)/(64*k^3 + 256)
}}}
The last line in particular is false, according to me.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8111>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
