> Division in localization always require membership test, implicit > or explict. Thinking more about this I see that what we really > need is a test if pair (a, b) is equivalent to valid element > of localization. That is we may need to remove common factors > before membership test for denominator.
Oh, right. In fact, in IntegerLocalizedAtPrime, I also keep the respective possible denominators factored from the numerator. Maybe that's not alway the most efficient way. However, you are right, in general computation is difficult, only for Laurent polynomials with an implementation as PolynomialRing(C, DirectProduct(n, Integer)) division would be easy. Or would you also allow (x+y)^2 / (x+y) ? For this case I would require the user to call exquo instead of /. The signature of / should already make it clear by what can be divided. Ralf -- You received this message because you are subscribed to the Google Groups "FriCAS - computer algebra system" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/fricas-devel/7be34992-c3f3-52c1-78fa-9fb44bbabc16%40hemmecke.org.
