# Extended gcd

Returns the final results of the extended Euclidean algorithm: an extension to the Euclidean algorithm which computes, besides the greatest common divisor of integers and , the coefficients of Bézout's identity, which are integers and such that

## Syntax

## Description

#### extended_gcd(Integer, Integer)

Given two integers and , returns a vector with three elements: the first one is the greatest common divisor of and , the second and the third ones are and , with the notation used above.