I was playing around with the möbius inversion formula and factorials and I came up with an equation that I found interesting:
$$\prod_{i\ge2}\left\lfloor\frac{x}{i}\right\rfloor! = \prod_{i \ge 2}\prod_{j \ge 1}\left(\left\lfloor\frac{x}{ij}\right\rfloor!\right)^{-\mu(i)}$$
I'm not sure if this equation is valid.
Here is the reasoning:
(1) Let $\text{lcm}(x) = $ the least common multiple of $\{1, 2, 3, \dots, x\}$
(2) Using a well known equation:
$$x! = \prod_{i \ge 1}\text{lcm}\left(\left\lfloor\frac{x}{i}\right\rfloor\right)$$
(3) Using mobius inversion, I believe that this is now valid:
$$\text{lcm}(x) = \prod_{i \ge 1}\left(\left\lfloor\frac{x}{i}\right\rfloor!\right)^{\mu(i)}$$
(4) Combining the two equations gets me to:
$$x! = \prod_{j \ge 1}\prod_{i \ge 1}\left(\left\lfloor\frac{x}{ij}\right\rfloor!\right)^{\mu(i)}$$
(5) Since order of the products doesn't matter:
$$x! = \prod_{i \ge 1}\prod_{j \ge 1}\left(\left\lfloor\frac{x}{ij}\right\rfloor!\right)^{\mu(i)}$$
(6) Since for $i=1,j=1$, $x! = \left(\frac{x}{ij}!\right)^{\mu(i)}$:
$$1 = \prod_{i \ge 1}\prod_{j \ge 1\text{ and }j\ne1\text{ if }i=1 }\left(\left\lfloor\frac{x}{ij}\right\rfloor!\right)^{\mu(i)}$$
(7) We can now use division to separate the remaining cases of $i=1$ so that we get:
$$\prod_{j \ge 2}\left\lfloor\frac{x}{j}\right\rfloor! = \prod_{i \ge 2}\prod_{j \ge 1}\left(\left\lfloor\frac{x}{ij}\right\rfloor!\right)^{-\mu(i)}$$
Is this equation correct? And if correct, is it well known?
The calculations are correct.
We recall an inversion formula which can be found for instance as Theorem 268 in An Introduction to the Theory of Numbers by G.H. Hardy and E.M. Wright:
If for all positive $x$ \begin{align*} G(x)=\sum_{j=1}^{\lfloor x\rfloor} F\left(\frac{x}{j}\right)\qquad\text{ then}\qquad F(x)=\sum_{j=1}^{\lfloor x\rfloor}\mu(j)G\left(\frac{x}{j}\right)\tag{3} \end{align*}
Comment:
In (6) we substitute (4) in (5).
In (7) we use the identity $\left\lfloor \left\lfloor \frac{x}{j} \right\rfloor \frac{1}{k}\right\rfloor=\left\lfloor \frac{x}{jk}\right\rfloor$. We also exchange the order of the products which is feasible since they are finite and we set the upper limit to $x$ without changing anything since we are only multiplying with $1$.
In (8) we separate the case $k=1$.
In (9) we divide by $x!$.