> That's the Chinese remainder problem[1]. The solution isn't unique so I > don't think this should be a classmethod of Integer.
Nearly so, but the routine will construct the number even if the moduli are not prime. Perhaps it should return a number like '15 mod 17' (FF(17)(15)). -- You received this message because you are subscribed to the Google Groups "sympy" group. 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/sympy?hl=en.
