I am running x = polygen(QQ) equation = -960000000*x^7 + 416000000*x^6 - 66400000*x^5 + 5600000*x^4 - 280000*x^3 + 8400*x^2 - 140*x + 1 roots = equation.roots(QQbar) a_root = roots[-1][0] abs_root = abs(a_root) %time abs_root.minpoly()
and am surprised that it takes approx. three minutes. Consequently, sorted(roots, key=lambda r: abs(r[0])) then still takes 8 Minutes. Is this expected behaviour? I am intersted in the smallest root(s) in absolute value only, any suggestions for achieving that in less time? Regards, Clemens -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.