#20086: rational powers in ZZ[X] and QQ[X]
-------------------------------------+-------------------------------------
Reporter: cheuberg | Owner:
Type: defect | Status: needs_review
Priority: major | Milestone: sage-7.1
Component: basic arithmetic | Resolution:
Keywords: | Merged in:
Authors: Clemens | Reviewers: Benjamin Hackl
Heuberger, Vincent Delecroix | Work issues:
Report Upstream: N/A | Commit:
Branch: | cba01eb6ebe741567cabc1e9e4a3dd0c94aa11b2
u/vdelecroix/20086 | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by vdelecroix):
When the polynomial is of degree 0 it would also be faster to actually
also relies on `nth_root`:
{{{
sage: %timeit 27.nth_root(3)
1000000 loops, best of 3: 388 ns per loop
sage: %timeit 27 ** (1/3)
100000 loops, best of 3: 7.51 µs per loop
}}}
As `nth_root` should be guaranteed to return an element of the same ring
there will also be much less coercion involved.
--
Ticket URL: <http://trac.sagemath.org/ticket/20086#comment:34>
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.
