next up previous contents index
suivant: Chinese remainders : ichinrem, monter: Integers (and Gaussian Integers) précédent: Bézout's Identity : iegcd   Table des matières   Index


Solving au+bv=c in $ \mathbb {Z}$: iabcuv

iabcuv(a,b,c) returns [u,v] so that au+bv=c.
c must be a multiple of gcd(a,b) for the existence of a solution.
Input :
iabcuv(48,30,18)
Output :
[6,-9]



giac documentation written by Renée De Graeve and Bernard Parisse