Find all primes p,q and even n>2 such that .

My idea:

.

Let k be the largest power of p dividing q+1, then

If k>1 then the RHS is divisible by p and LHS is not(I am using n>2)

so for some

It looks like I have deduced something, but then what do we do??

Or is this approach useless??