A generalization of the Ramanujan-Nagell equation
Abstract
We shall show that, for any positive integer D>0 and any primes p1, p2 not dividing D, the diophantine equation x2+D=2s p1k p2l has at most 63 integer solutions (x, k, l, s) with x, k, l≥ 0 and s∈ \0, 2\.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.