hi, In sympy number's module (sympy.core.numbers) extended gcd algorithm performs over normal arithmetic. Is there an implementation of it over modulo arithmetic in sympy? which means to find x and y such that a*x+b*y=gcd(a,b) modulo n?
regards, kasun -- 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.
