I wrote a Diophantine equation and tried solving it. Then I got stuck at a stage of the solution.
Problem: Find all $(x,y)$ positive integer pairs that satisfy the equation $5^x - y^2=4$.
My Partial Solution: If $x$ is an even number then $x=2n\quad$ ($n \geq 1$ an integer). Therefore $$ (5^n - y)(5^n + y) = 4$$ and we can write \begin{equation*} \left\{ \begin{split} 5^x-y & = 1 \\ 5^x + y & = 4 \end{split} \right. \end{equation*} Thus, $2\cdot 5^x = 5$ and there is no positive integer solution in this case.
If $x$ is an odd number,
$\bullet$ For $x=1$; $\quad 5^1 -y^2=4 \implies y=1$.
$\bullet$ For $x=3$; $\quad 5^3 -y^2=4 \implies y=11$.
$\bullet$ For $x\geq 5$; I thought of finding a contradiction using modular arithmetic. For example; $x=2k + 3 , \quad$ ($k\geq 1 $ an integer) $125\cdot 25^k - y^2 = 4$. In $\mod 24$, $$5 - y^2 \equiv 4 \pmod{24}$$
But this is not a contradiction. So, I failed. How can I tell if the equation has a solution for $x>3$ or not? Thanks for your interest.