Extended Euclid and Inverse Element

Extended Euclid and Inverse Element

See the complete article of my own blog https://dyingdown.github.io/2019/08/14/Extended-Euclid-and-Inverse-element/
Today’s importance is inverse element, however, inverse element calculation is based on the extended Euclid algorithm. At first, we need to know the Euclid’s algorithm.

A much more efficient method is the Euclidean algorithm, which uses a division algorithm such as long division in combination with the observation that the gcd of two numbers also divides their difference. --from Wikipedia

Extended Euclided

$$ax+by=gcd(a,b)$$

From the Euclid Method of calculating gcd, we know that
$$gcd(a,b)=gcd(b,a\%b)$$
We set another function
$$b{x}_1+(a\%b)y_1=gcd(b,a\%b)$$
So, combine the first function with the third function we got
$$\begin{gathered} ax+by=b{x}_1+(a\%b)y_1 \\ \Rightarrow ax+by=b{x}_1+(a-a/b\times b)y_1 \\ \Rightarrow ax+by=b{x}_1+a{y}_1-b\times (a/b)y_1 \\ \Rightarrow ax+by=a{y}_1+b(x_1-a/b\times y_1) \\ \Rightarrow \{\begin{array}{rl}x& =y_1\\ y& =(x_1)-a/b\times y_1)\end{array} \end{gathered}$$
We define that if
$$b=0:x=1,y=0$$
So we can write our function in this way

typedef pair<int,int> P;
P gcdEx(int a, int b){
    if(b == 0) return P(1, 0);
    else{
        P p = gcdEx(b, a % b);
        return P(t.second, t.first - (a / b) * t.second);
    }
}

The previous one is the direct one we can get from the mathematical function. Here is a better way of writing it.

void gcdEx(int a, int b, int &x, int &y){
    if(b == 0){
        x = 1; y = 0;
    }else{
        gcdEx(b, a % b, y, x);
        y -= a / b * x;
    }
}

Inverse Element

$$ax\equiv 1(modb)$$

There is a inverse element only if a and b are both prime numbers. The equation above means both side mod b at the same time is equal. x is a reverse element of a under mod b.

We can change the equation into this.
$$\begin{gathered} axmodm=1 \\ ax-my=1 \end{gathered}$$
y is the middle element used to solve x.

So the code looks like this.

int x, y;
gcdEx(a, m, x, y);
x = (x % m + m) % m;

x is the inverse element of a.