Papers
Topics
Authors
Recent
Search
2000 character limit reached

On a class of Lebesgue-Ramanujan-Nagell equations

Published 11 May 2020 in math.NT | (2005.05214v3)

Abstract: We deeply investigate the Diophantine equation $cx2+d{2m+1}=2yn$ in integers $x, y\geq 1, m\geq 0$ and $n\geq 3$, where $c$ and $d$ are given coprime positive integers such that $cd\not\equiv 3 \pmod 4$. We first solve this equation for prime $n$, under the condition $n\nmid h(-cd)$, where $h(-cd)$ denotes the class number of the quadratic field $\mathbb{Q}(\sqrt{-cd})$. We then completely solve this equation for both $c$ and $d$ primes under the assumption that $\gcd(n, h(-cd))=1$. We also completely solve this equation for $c=1$ and $d\equiv1 \pmod 4$, under the condition $\gcd(n, h(-d))=1$. For some fixed values of $c$ and $d$, we derive some results concerning the solvability of this equation.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.