Hi ,

Please can you help me with this problem .

I need to find the inverse of 2 modulo 11 using gcd(11,2) and modulo congruence.

I know I can start like this:

gcd(11,2)

11 = 2*5 + 1

2 = 1*2 + 0

then I used modulo congruence:

1=11 - 2*5 (mod 11)

....

I know the answer is 6 mod 11. because I used another method.

I want to know how to find it using modulo congruence.

Please can you help me ?

Thank you for your help

B