On Jan 13, 10:01 am, Marco Streng <marco.str...@gmail.com> wrote: > Polynomials in Sage have a well-defined degree, and that means that > the leading coefficient cannot be (numerically) zero, the degree of > 0.0 is ambiguous unless we decide that 0.0 is just 0, in which case we > may as well print it as such.
That's good to know! So doing computations in sage with numerical polynomials does not give you an upper bound on the degree of the resulting polynomial, contrary to what one would get from a naive implementation: sage: R.<x>=CDF[] sage: f=10^30*x sage: g=3*x sage: (g+f)-f 0 sage: ((g+f)-f).list() [] sage: ((g+f)-f).degree() -1 -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To post to this group, send email to sage-devel@googlegroups.com. To unsubscribe from this group, send email to sage-devel+unsubscr...@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel?hl=en.
