For which $n\in\mathbb{N}$ $$4\cdot 7^{n} - 3 = m^{2}$$ for some $m\in\mathbb{N}$? Here $\mathbb{N} = \mathbb{Z}\cap[0;+\infty)$.
First thing to notice is that the case with even $n$ is pretty obvious, since there are not many squares that differ by $3$. In fact, there is only one such pair: $1$ and $4$, which yields $(n,m) = (0,1)$. Now we are left to deal with the odd values of $n$. It turns out that this case is more interesting, as there are at least two solutions: $n=1$ and $n=3$.
I thought of proving that these are the only solutions in this case, but didn't succeed. It was not much use to apply modular arithmetic, since it is more helpful when proving that there are no solutions. It can give something like $m = 2k+1$, and maybe some algebraic manipulations can transform the equation to a more obvious one, but I don't see that right away. Also, it seems that $4\cdot 7\cdot 7^{n-1} - 3 = 28N^{2}-3 = m^{2}$ has infinitely many solutions in $(N,m)\in\mathbb{N}\times\mathbb{N}$, so one must use the fact that $N$ is a power of $7$ somehow.
I wouldn't like to see a full solution, but rather just hints or strategies.
All kinds of approaches are welcomed, but I prefer those that are as elementary as possible. If you have a solution (even using a computer), you may post it, why not
– chirico Apr 14 '25 at 12:35