2000 character limit reached
On the solutions of certain Lebesgue-Ramanujan-Nagell equations
Published 2 Nov 2020 in math.NT | (2011.01099v3)
Abstract: We completely solve the Diophantine equation $x2+2k11\ell19m=yn$ in integers $x,y\geq 1;~ k,\ell, m\geq 0~$ and $n\geq 3$ with $\gcd(x,y)=1$, except the case $2\mid k, 2\nmid \ell m$ and $5\mid n$. We use this result to recover some earlier results in the same direction.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.