Consider a finite sequence $x_i \in (0,1)$ for $i=1,\ldots, n$ and define $y_i=\dfrac{\Pi_{j=1}^n x_j }{x_i}$.
I solved this system for $x$ in terms of $y$ and got $$x_i=\dfrac{\left(\Pi_{j=1}^n y_j \right)^\frac{1}{n-1}}{y_i}.$$
Now pick some $m<n$. Is there a simple way of solving $(x_1,\ldots x_m, y_{m+1},\ldots, y_n)$ in terms of $(y_1,\ldots y_m, x_{m+1},\ldots, x_n)$?
If we take logs, this is a linear system. My only idea on how to solve is to write the system for $n=2,3$ and solve it by brute-force to see if some pattern emerges and if so, make a conjecture and prove it... But perhaps someone can easily see some clever trick I am missing. This is not homework. It is for some lemma I need in my paper.