Solve Equation $ax+by=d$ where $d \neq \gcd(a,b)$ using Bézout
139863
There exists more than one set of numbers $(m,n)$ so that $132m+34n=\gcd(132,34)$?
35874
Show that when $BA = I$, the solution of $Ax=b$ is unique
15753
Solve the following equation in positive integers $x$ and $y$
53560
Find largest $k$ such that the diophantine equation $ax+by=k$ does not have nonnegative solution.
946
How to find solutions of linear Diophantine ax + by = c?
2904
Solving linear congruence (modular inverse or fraction) via gcd Bezout equation
76507
$\gcd(b^x - 1, b^y - 1, b^ z- 1,\dots) = b^{\gcd(x, y, z,\dots)} -1$
18203
Diophantine equation $a^2+b^2=c^2+d^2$
156966
Prove that if $b = dk$ where $gcd(m, a) = d$, there are $d$ solutions to $ax \equiv b \mod m$
21788
Proving that if $ad-bc = \pm 1$, then $\gcd(x,y) = \gcd(ax +by, cx + dy)$
19656
Proving that $ \gcd(a,b) = as + bt $, i.e., $ \gcd $ is a linear combination.
18903
Finding solutions to equation of the form $1+x+x^{2} + \cdots + x^{m} = y^{n}$
82931
How do I solve a linear Diophantine equation with three unknowns?
155012
Solving quadratic equations in modular arithmetic
59479
For a positive integer $n\geq 2$ with divisors $1=d_1<d_2<\cdots<d_k=n$, prove that $d_1d_2+d_2d_3+\cdots+d_{k-1}d_k<n^2$
77064
Proving $\gcd((a+b)^m,(a-b)^m)\le2^m$ for coprime $a,b$ and $m \in \Bbb N$
92630
How to prove $\gcd(a^m,b^m) = \gcd(a,b)^m$ using Bézout's Lemma