#20731: shortcut coercion for Integer-Rational operations
-------------------------------------+-------------------------------------
Reporter: vdelecroix | Owner:
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-7.3
Component: coercion | Resolution:
Keywords: sd74 | Merged in:
Authors: Vincent Delecroix | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/vdelecroix/20731 | eec41681c0fc9bb3b377ad67a31634a40d277782
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by jdemeyer):
I just thought about the following very simple algorithm for the
multiplication (division is analogous):
To compute `(A/B) * C`, you initialize the result as `C/B`, canonicalize
it and then multiply the numerator by `A`.
You don't need to canonicalize the final result, since `gcd(A,B) = 1` by
assumption.
--
Ticket URL: <http://trac.sagemath.org/ticket/20731#comment:11>
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 https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
