Solving $n(4n+3)=2^m-1$ in positive integers

diophantine equationselementary-number-theoryexponential-diophantine-equationsprime numbersquadratic-integer-rings

Find all positive integers $m$ and $n$ such that $$n(4n+3)=2^m-1\,.$$

This is an interesting equation which was sent to me by a friend (probably found online). I have been scratching my head about whether or not this has a unique solution in positive integers which I have found to be $(n,m)=(1,3)$. My first approach was trying to work some mod casework but it hasn't been really helpful and the only thing I found which I guess was worth, is that $$n \equiv 1\pmod{ 8},\forall \ m \geq 3\,.$$ I have noticed that $2^m-1$ for $m=3$ is prime and so I conjecture that whenever $2^m-1$ is not a prime then the equation will not have a solution in positive integers but I am stuck on proving this last statement. Any hints will be appreciated.

Best Answer

Rewrite it as a quadratic equation in $n$: $4n^2+3n -2^m+1 = 0\implies \triangle = 3^2-4(4)(1-2^m)= 9-16+16\cdot 2^m=2^{m+4}-7=k^2\implies k^2+7=2^{m+4} $. This problem has appeared in an article by author J.Cremona of Nottingham UK, and in that article, they proved that the only possible solutions are: $m + 4 = 3,4,5,7,15$. I leave this for you to finish.

Reference:

$1)$.https://www.researchgate.net/publication/266524000_On_the_Diophantine_equation_x_2_7y_m