Showing that ord(a,b)*gcd(a,b,n)=n $ord(a,b)$ is the order of the element (a,b) in the additive group $(\mathbb{Z}/(n))^2$. 
Why is $ord(a,b)\cdot gcd(a,b,n)=n$?
Thank you in advance.
 A: The order of $(a,b)$ in $(\mathbb Z_n)^2$ is the smallest $k$ such that
$$
k(a,b)=(0,0)\in(\mathbb Z_n)^2\iff ka=kb=0\in\mathbb Z_n
$$
Now let $k$ be any integer satisfying the above relation. Then using Bezout's identity
$$
\gcd(a,b)=\lambda a+\gamma b
$$
and considering it modulo $n$ we get
$$
k\cdot\gcd(a,b)=\lambda ka+\gamma kb=\lambda 0+\gamma 0\in\mathbb Z_n
$$
In particular this works for $k=\operatorname{ord}(a,b)$ which is just a particular such value of $k$.
A: The order of $(a,b)$ in $\mathbb{Z}_n \times \mathbb{Z}_n$ is given by: $LCM\left(\frac{n}{(a,n)}, \frac{n}{(b,n)}\right)$. Now we have:
$$\left[\frac{n}{(a,n)}, \frac{n}{(b,n)}\right] = \frac{n^2}{(b,n)(a,n)\left(\frac{n}{(a,n)}, \frac{n}{(b,n)}\right)} = \frac{n^2}{(b,n)(a,n)\frac{n}{[(a,n),(b,n)]}} = \frac{n(a,n)(b,n)}{(b,n)(a,n)((a,n),(b,n))} = \frac{n}{(a,b,n)}$$
Where we used the notation $(a,b) = GCD(a,b)$ and $[a,b] = LCM(a,b)$
A: $n\mid ka,kb \iff n\mid ka,kb,kn\!\! \overset{\ \ \rm\color{#c00}{U}}\iff n\mid (ka,kb,kn)\overset{\rm\color{#0a0}{D}}=(a,b,n)k\iff n/(a,b,n)\mid k$
${\rm ord}(a,b)\, $ is the least positive such $k,\,$ which, by above, is clearly $\,k = n/(a,b,n).$
Above we used $\:\rm\color{#c00}{U} = $ gcd Universal property: $\,\ n\mid i,j\iff n\mid(i,j)$  
Also, $ $ we used  $\, $ $\rm\color{#0a0}{D}$ = gcd Distributive law: $\,\ (ik,jk,\ell k) = (i,j,\ell)k$
