I was looking at the question Is $7$ the only prime followed by a cube? and I was running through some of the low powers of $n^m-1$
I tried $m=2$ and got that $n^2-1=(n+1)(n-1)$ I reasoned that $n+1>1$ because otherwise $n-1<0$ and cannot be prime. So setting $n-1=1$ we get $n=2$ and that gives us our prime of $2+1=3$ which should be the largest prime followed by a square.
Next I tried $m=4$ and got that $n^4-1=(n^2+1)(n^2-1)$ with $n^2+1>1$. But now $n^2-1=1$ implying that $n = \pm \sqrt 2$ which is not an integer. I took this as a contradiction and reason that there are no primes following powers of 4.
Finally, I looked at $m=2k$ and got that $n^{2k}-1=(n^k+1)(n^k-1)$ with $n^k+1>1$. I get the same thing $n^k-1=1$ implying that $n = \pm \sqrt[k] 2$ which is not an integer for $k>1$ (which gives a reason that $m=2$ works).
Is my reasoning correct? Are there really no primes following even powers greater than 2 of n?