How do I solve this problem using extended Euclidean Algorithm? 19d $\equiv$ 1 (mod 96)
2904
Solving linear congruence (modular inverse or fraction) via gcd Bezout equation
59856
Find $x,y$ given $\gcd(x,y)$ and ${\rm lcm}(x,y)$
29517
How to find continued fraction of pi
108035
solving diophantine equations using congruences
40122
Why does the Euclidean algorithm work for polynomials? What is the proof?
5868
Find the real number $x$ represented by continued fraction $[12;2,2,12,2,2,12,2,2,12\dots]$
143754
Finding the solution of the congruence $4x\equiv16\pmod{26}$
8784
modulo version of the quadratic formula and Euler's criterion
102860
solve $3x^2 + 6x +1 \equiv 0 \pmod {19}$
94958
Prob. 6 (d), Chap. 1, in Baby Rudin, 3rd ed: How to complete this proof?
36713
Solving multiple congruences by CRT = Chinese Remainder Theorem
118955
Specific steps in applying the Chinese Remainder Theorem to solve modular problem splitting modulus
10724
Case of the 'mice problem' for $n=3$
4475
Find the remainder when $2^{2016}$ is divided by $47$
109900
Why is $e^{\pi \sqrt{163}}$ almost an integer?
131941
Solve quadratic congruences.
24351
The ring $\Bbb Z\left [\frac{-1+\sqrt{-19}}{2}\right ]$ is not a Euclidean domain