Let $p=2^a1>7$ be a Mersenne prime and so $a$ is an odd prime. Can we say that $(p^2+1)/2$ is not equal to the square of a prime number? Many thanks for your help BHZ

Suppose, $p^22p_1^2=1.$ Substituting $p=2^a1,$ we arrive at $$2^a(2^{a1}1)=(p_11)(p_1+1).$$ Observe, $(p_11,p_1+1)=2,$ so we must have the following options: $p_11=2^{a1}k$ and $p_1+1=2l$ and $kl=2^{a1}1.$ This is impossible unless $k,l$ and thus $a$ are small. Indeed, if $k\ge 2,$ then $p_1\ge 2^a+1$ and $l\ge 2^{a1}$ so $kl\ge2^a.$ If $k=1,$ then $p_1=2^{a1}+1$ and $l=2^{a2}+1$ and $kl=2^{a2}+1=2^{a1}1.$ This implies $a=3.$ Otherwise, $p_11=2k$ and $p_1+1=2^{a1}l$ and $kl=2^{a1}1.$ Again it is possible only if $k,l$ and $a$ are small. These case can be checked by hands. 


A result of Szalay [Indag. Math. 2002] gives you what you want. He proves that the equation $$ 2^x2^y+1 = z^2 $$ has only the solutions $$ (x,y,z)=(2t, t+1, 2^t1), (t1,t1,1), (5,3,5), (7,3,11), (15,3,181) $$ in positive integers $x, y$ and $z$ (here, $t \geq 2$ is an integer). The proof uses lower bounds for $$ \left \sqrt{2}  \frac{p}{2^k} \right $$ and elementary arguments. 

