Let $z,n,x,y,m$ be positive integers with $z \ge 5$ and $m \ge 3$ and $m$ odd.
Does it follow that:
$z$ cannot be prime
if $p \ge 5$ and $p | z$, then either $p > m$ or $p|m$
Here is my reasoning:
If $z$ is prime, then there are no solutions as shown here.
If $p | z$, $p$ doesn't divide $x$ or $y$ since if we assume $n$ is the lowest positive integer solution, we get a contradiction by the logic in step 1 if $p | xy$
If $p \le m$, then using Lifting the Exponent (see Theorem 2), $p$ must divide both $x+y$ and $\dfrac{x^m + y^m}{x+y}$ and there is no solution unless $p | m$.
Am I correct? Is there a mistake in my reasoning? Is there a counter example?
Edit: added details to explain why LTE applies based on comments received.
Edit 2: for this logic to be correct, each $p \ge 5$.