Extended GCD
The symbol represents the n-ary function, a_1,...,a_n to return a list consisting of the gcd (greatest common divisor) of its arguments, together with n elements x_1,...,x_n such that gcd(a_1,...,a_n)=x_1 a_1+...+x_n a_n
<OMOBJ xmlns="http://www.openmath.org/OpenMath" version="2.0"> <OMA><OMS name="extended_gcd" cd="arith3"/> <OMA><OMS cd="arith3" name="extended_gcd"/> <OMI> 6 </OMI> <OMI> 10 </OMI> <OMI> 15 </OMI> </OMA> <OMA><OMS name="list" cd="list1"/> <OMI>1</OMI> <OMI>1</OMI> <OMI>-2</OMI> <OMI>1</OMI> </OMA> </OMA> </OMOBJ>
<math xmlns="http://www.w3.org/1998/Math/MathML"> <apply><csymbol cd="arith3">extended_gcd</csymbol> <apply><csymbol cd="arith3">extended_gcd</csymbol><cn>6</cn><cn>10</cn><cn>15</cn></apply> <apply><csymbol cd="list1">list</csymbol> <cn>1</cn> <cn>1</cn> <cn>-2</cn> <cn>1</cn> </apply> </apply> </math>