Let $a$, $b$, $c \in \mathbb{N}$. $[a, b]$ denotes $\mathrm{lcm}(a, b)$ and $(a,b)$ denotes $\gcd(a, b)$
Show that
- $(a,[b,c]) = [(a,b),(a,c)]$.
- $[a,(b,c)] = ([a,b],[a,c])$.
Let $a$, $b$, $c \in \mathbb{N}$. $[a, b]$ denotes $\mathrm{lcm}(a, b)$ and $(a,b)$ denotes $\gcd(a, b)$
Show that
HINT $\ $ Using the basic GCD laws (associative, commutative, distributive) and, furthermore, employing $\rm\:[x,y] = xy/(x,y)\:$ to eliminate LCMs, we obtain
$$\begin{array}{lrll} &\rm(a,[b,c]) &=&\rm [(a,b),(a,c)]&\qquad\qquad\qquad\qquad\quad \\ \iff &\rm(a,bc/(b,c)) &=&\rm (a,b)(c,a)/(a,b,c)& \\ \iff &\rm(a,b,c)(ab,ac,bc) &=&\rm (a,b)(a,c)(b,c)& \end{array} $$
true since both sides $\rm\: =\: (abc, baa,caa, abb,cbb, acc,bcc)\:$ (i.e. all trinomials except cubes), after expanding, by distributivity. The dual identity is proved similarly, yielding the same equality.