Thanks, Mike! This works perfectly. --M
On May 5, 11:09 am, Mike Hansen <mhan...@gmail.com> wrote: > Hello, > > On Wed, May 5, 2010 at 5:03 AM, Matt Bainbridge > > <bainbridge.m...@gmail.com> wrote: > > I wrote a sage program which does a lot of arithmetic in the field of > > rational functions Frac(Q[x,y,z]). The problem is that sage doesn't > > check for common divisors of the numerator and denominator, so after > > doing a lot of arithmetic operations, I end up with rational functions > > whose numerator and denominator are divisible by huge integers (on the > > order of 2^3000). Is there a reasonable way to get sage to eliminate > > common factors after each arithmetic operation? > > Currently, the easiest way to do this is just to work over > Frac(ZZ[x,y,z]) which is equivalent. > > --Mike > > -- > To post to this group, send email to sage-support@googlegroups.com > To unsubscribe from this group, send email to > sage-support+unsubscr...@googlegroups.com > For more options, visit this group > athttp://groups.google.com/group/sage-support > URL:http://www.sagemath.org -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
