Bezout's Identity
Statement and Demonstration of Bezout's Identity
Statement: $\forall a,b \in \mathbb{Z}, \exists x,t \in \mathbb{Z}$, such that $ ax + by = \gcd (a,b) $.
[Read More]
Why does the Euclidean Algorithm for finding G.C.D of two number work?
A look into the inner workings of the Euclidean Algorithm
We can prove that the Euclidean Algorithm works by using a standard argument in number theory: showing that a problem is equivalent to the same...
[Read More]