#19999: infinite recursion creating certain asymptotic expansion
-------------------------------------+-------------------------------------
Reporter: dkrenn | Owner:
Type: defect | Status: needs_review
Priority: major | Milestone: sage-7.1
Component: asymptotic | Resolution:
expansions | Merged in:
Keywords: | Reviewers:
Authors: Benjamin Hackl | Work issues:
Report Upstream: N/A | Commit:
Branch: u/behackl/exp- | b506dff52dc57995e229f57144f280516c0b6b8b
growth-inf-loop | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by behackl):
Replying to [comment:10 dkrenn]:
> Replying to [comment:8 behackl]:
> >
||[http://git.sagemath.org/sage.git/commit/?id=c023a81fc39966b870d467382a66dab94d1d52b0
c023a81]||{{{let (-q)^x and q^x be incomparable}}}||
>
> I believe the `-other.base` in
> {{{
> return bool(abs(self.base) <= abs(other.base)) and \
> bool(self.base != -other.base)
> }}}
> is not general enough (you could have complex bases as well).
> Why not
> {{{
> bool(abs(self.base) < abs(other.base)) or bool(self.base == other.base)
> }}}
> ?
Yep, I was thinking of reals a bit too much; I'll change the statement.
--
Ticket URL: <http://trac.sagemath.org/ticket/19999#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.
