When I was doing my math team training, I encountered a hard question again.
Let $x,y,z$ be positive integers that $x<y<z$ with $$\begin{cases} yz\equiv1\mod x\\ zx\equiv1 \mod y\\xy\equiv1\mod z\end{cases}$$Find all triples $(x,y,z)$ such that the above equation holds.
Coach's hint
First, if one of the variable equals to $1$, then at least one of the other variable equals $1$ (I don't know why, so please explain also), which contradicts with they are distinct.
I have no idea how to do the question. I just found that $(2,3,5)$ is a solution but I can't find any other solutions. But I can't find any prove to prove that there are no other solutions.
Thanks for any help!