Some experiments with Ramanujan-Nagell type Diophantine equations
Maciej Ulas

TL;DR
This paper explores the construction of Ramanujan-Nagell type Diophantine equations with multiple solutions, providing new examples and conjectures based on extensive numerical analysis.
Contribution
It demonstrates the existence of infinite families of such equations with at least four solutions and constructs specific examples with up to six solutions, advancing understanding of their solution structures.
Findings
Existence of infinite sets of equations with at least four solutions.
Construction of equations with exactly five solutions for certain k.
New examples of equations with six solutions in positive integers.
Abstract
Stiller proved that the Diophantine equation has exactly six solutions in positive integers. Motivated by this result we are interested in constructions of Diophantine equations of Ramanujan-Nagell type with many solutions. Here, (thus are not necessarily positive) and are given integers. In particular, we prove that for each there exists an infinite set containing pairs of integers such that for each we have is square-free and the Diophantine equation has at least four solutions in positive integers. Moreover, we construct several Diophantine equations of the form with , each containing five solutions in non-negative integers. %For example the equation has exactly five solutions with $n=0, 6, 11, 15,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Advanced Mathematical Identities · Algebraic Geometry and Number Theory
