.
I'm trying to show an alternative proof to Bezout's Lemma (let $a, b \in \mathbb{Z}$, then there exists $x,y \in \mathbb{Z}$ such that $gcd(a, b) = ax + by$). Heres one of the steps in proving it:
a) Show the case where $a=b=0$. Then assume $a$ and $b$ are not both zero. Consider the set $S = $ {$s \in \mathbb{N} | \exists m,n \in \mathbb{Z}, s = ma+ nb $}. Prove that $s \not= \emptyset $ by showing that at least one of $|a|$ or $|b|$ is an element of $S$.
My work:
I'm assuming for $a=b=0$ we can just say that since $gcd(0,0)$ = $0$ and since $0x + 0y = 0$ then $gcd(0,0) = ax + by$ for $a=b=0$. And for the second part can you simply say if $a \not= 0$ and $b \not= 0$ and since $s = ma + nb$ then $|a|$ or $|b|$ must be in $S$?.. Thanks for your help!