-
MathType
-
Wiris Quizzes
-
Learning Lemur
-
CalcMe
-
MathPlayer
-
Store FAQ
-
VPAT for the electronic documentation
-
MathFlow
-
BF FAQ
Extended gcd
Reading time: 1minReturns the final results of the extended Euclidean algorithm: an extension to the Euclidean algorithm which computes, besides the greatest common divisor of integers a and b, the coefficients of Bézout's identity, which are integers x and y such that ax+by=gcd(a,b)
Syntax
extended_gcd(Integer, Integer)
Description
Given two integers a and b, returns a vector with three elements: the first one is the greatest common divisor of a and b, the second and the third ones are x and y, with the notation used above.
