If I understand things correctly, the improved code for
dup_roots_upper_bound will NEVER pass Travis CI, because the intervals it
gets are different from the ones to be asserted in the tests.


On Sat, Mar 15, 2014 at 1:26 AM, Aaron Meurer <notifications@github.com>wrote:

> In sympy/polys/rootisolation.py:
>
> >
> > -       Reference:
> > -       ==========
> > -       Alkiviadis G. Akritas: "Linear and Quadratic Complexity Bounds on the
> > +    Reference:
> > +    ==========
> > +    Alkiviadis G. Akritas: "Linear and Quadratic Complexity Bounds on the
>
> It looks like you messed up the indentation here.
>
> --
> Reply to this email directly or view it on GitHub<https://github.com/sympy/sympy/pull/7257/files#r10631088>
> .
>



-- 
All the best,

Alkis