Equation between the greatest common divisor and the least common multiple

Question

the symbols $(a,b,c,...,g)$ and $[a,b,c,...,g]$ are denote the greatest common divisor and the least common multiple, respectively for the positive integers $a,b,c,...g$.

Example :

$(3,6,18)=3$ and $[6,15]=30$ Prove that:

$${{[a,b,c]}^2\over{[a,b][b,c][c,a]}}=\frac{{(a,b,c)}^2}{(a,b)(b,c)(c,a)}$$ I don't know how to start can you help me please ?

Thanks in advance

Answer 1

To my mind, this sort of problem becomes easier to think about when you think of $(\ldots)$ and $[\ldots]$ as $\min$ and $\max$, respectively, applied separately to the exponents of all primes. Then your equation becomes

\begin{align} &2\max(a,b,c)-(\max(a,b)+\max(b,c)+\max(c,a))\\={}&2\min(a,b,c)-(\min(a,b)+\min(b,c)+\min(c,a)) \end{align}

This you can easily check by assuming without loss of generality that $a\le b\le c$; the equation then becomes

$$ 2c-(b+c+c)=2a-(a+b+a)\;. $$

Answer 2

If you want a hint how to start, then you could replace all lcm's on the LHS by gcd's. For two elements this is clear, and for three you can use the following result:

Theorem $$\operatorname{lcm}(a,b,c)=\frac{a\cdot b\cdot c\cdot \operatorname{gcd}(a,b,c)}{\operatorname{gcd}(a,b)\cdot \operatorname{gcd}(a,c)\cdot \operatorname{gcd}(b,c)}$$

Reference: This question.