Problem

Source: Bundeswettbewerb Mathematik 1988, stage 2, problem 4

Tags: number theory, Diophantine equation, equation, algebra, IMO Shortlist



Provided the equation $xyz = p^n(x + y + z)$ where $p \geq 3$ is a prime and $n \in \mathbb{N}$. Prove that the equation has at least $3n + 3$ different solutions $(x,y,z)$ with natural numbers $x,y,z$ and $x < y < z$. Prove the same for $p > 3$ being an odd integer.