Aaron I am still having problems:

I removed all the comments, simplified the few "wierd" expressions, like
t = n * [K.one], q = min(Q) and still get FAIL on
sympy/polys/tests/test_polytools.py[133] and
sympy/core/tests/test_sets.py[45].

I see how busy you are with sympy but without your help I do not know what
to do.

Here is the code without the doc string.  Thank you!

def dup_root_upper_bound(f, K):
    """
    """
    n, P = len(f), []
    t = n * [K.one]   # list instead of single counter
    if dup_LC(f, K) < 0:
        f = dup_neg(f, K)
    f = list(reversed(f))

    for i in xrange(0, n):
        if f[i] >= 0:
            continue

        a, Q = K.log(-f[i], 2), []

        for j in xrange(i + 1, n):

            if f[j] <= 0:
                continue

            q = t[j] + a - K.log(f[j], 2)
            Q.append([q // (j - i) , j]) # index added to the canditates
for minimum

        if not Q:
            continue
    # q = min(Q)
    q = Q[0]  # compute min of q[0] values
    for i in range(1, len(Q)):
        if q[0] > Q[i][0]:
        q = Q[i]
    t[q[1]] += 1 # only minimum's t is increased
    P.append(q[0])

 if not P:
     return None
 else:
     return K.get_field()(2)**(max(P) + 1)



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