2014
DOI: 10.3336/gm.49.2.04
|View full text |Cite
|
Sign up to set email alerts
|

Some experiments with Ramanujan-Nagell type Diophantine equations

Abstract: Abstract. Stiller proved that the Diophantine equation x 2 + 119 = 15 · 2 n has exactly six solutions in positive integers. Motivated by this result we are interested in constructions of Diophantine equations of Ramanujan-Nagell type x 2 = Ak n + B with many solutions. Here, A, B ∈ Z (thus A, B are not necessarily positive) and k ∈ Z ≥2 are given integers. In particular, we prove that for each k there exists an infinite set S containing pairs of integers (A, B) such that for each (A, B) ∈ S we have gcd(A, B) i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

1
1
0
1

Year Published

2015
2015
2021
2021

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 13 publications
(31 reference statements)
1
1
0
1
Order By: Relevance
“…In this paper, we prove that the Ramanujan-Nagell type Diophantine equation x 2 + Ak n = B has at most three nonnegative integer solutions (x, n) for A = 1, 2, 4, k an odd prime and B a positive integer. Therefore, we partially confirm two conjectures of Ulas from [23]. …”
supporting
confidence: 79%
“…In this paper, we prove that the Ramanujan-Nagell type Diophantine equation x 2 + Ak n = B has at most three nonnegative integer solutions (x, n) for A = 1, 2, 4, k an odd prime and B a positive integer. Therefore, we partially confirm two conjectures of Ulas from [23]. …”
supporting
confidence: 79%
“…Adapun usaha untuk mencari solusi persamaan (1) terus dilakukan, salah satu hasil penelitian terbaru telah dipublikasikan oleh Maciej Ulas pada tahun 2014. Dalam tulisannya [4], Ulas mengajukan sebuah konjektur berikut ini:…”
Section: Persamaan Diophantine X 2 = Y N + 2185unclassified
“…One can see for examples [1]- [21]. One aspect of the study of equation (1.2) is to determine the integer solutions (x, k, n).…”
Section: Introductionmentioning
confidence: 99%