This works but is too slow for more complicated examples. Is there a way to speed up "x in I" for much bigger examples? Or does this already use the fastest algorithm based on groebner basis or something else.
On Sep 6, 9:22 pm, Alex Ghitza <[email protected]> wrote: > On Mon, 6 Sep 2010 20:42:43 -0700 (PDT), Cary Cherng <[email protected]> > wrote: > > Given p_i and q in Q[x_1,...,x_n] I want to see if q is in the ideal > > (p1,...,pm). Does sage have easy support for this? > > Is this what you're looking for: > > sage: R.<x, y> = QQ[] > sage: I = R.ideal(x^2, y) > sage: x^2*y+y^2 in I > True > sage: x in I > False > > Best, > Alex > > -- > Alex Ghitza --http://aghitza.org/ > Lecturer in Mathematics -- The University of Melbourne -- Australia -- To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
