Hello Aaron, > There's a decent chance this algorithm is already implemented and just > not integrated into the RootOf object, so I would search around the > polys code first.
Thanks for the tip. I've been getting to know the `rem()` and `reduce()` functions a little more. From what I've seen so far I still think it'll require some work since the point of efficient modular exponentiation is to avoid computing `p(x)**n` first before reducing it modulo `x**p`. Nonetheless, it'll be a good first step. -- Chris -- You received this message because you are subscribed to the Google Groups "sympy" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sympy. To view this discussion on the web visit https://groups.google.com/d/msgid/sympy/AE405E82-55C4-481D-A87A-463F94762929%40gmail.com. For more options, visit https://groups.google.com/d/optout.
