For x, m != 0 in a Euclidean domain, one should have:
x == m*(x.div(m)) + x.mod(m) Although one can get the result of x.div(m) as x.quo_rem(m)[0], but I would suggest having this as a separate function. I know that it is more efficient, if one wants both, to use quo_rem, and essentially no worse, but students see will div and mod operators in class, and the syntax for quo_rem is more obscure to find and to use. --David --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
