Hello group, I realised that extended GCD for several integers is not implemented in Sage (i.e. xgcd2([a1, ..., an]))
Actually this feature already exists in Magma : > ExtendedGreatestCommonDivisor([385, 231, 165, 105]); 1 [ -2, 1, 2, 2 ] It could be interesting to have something like : g, u = xgcd2([a1, ..., an]) with u such that : a1*u1 + ... + an*un = g Do you think a new ticket could be posted? Thanks, François -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
