2020
DOI: 10.5486/pmd.2020.8752
|View full text |Cite
|
Sign up to set email alerts
|

Complete solutions of certain Lebesgue--Ramanujan--Nagell type equations

Abstract: It is well-known that for p = 1, 2, 3, 7, 11, 19, 43, 67, 163, the class number of Q(√ −p) is one. We use this fact to determine all the solutions of x 2 + p m = 4y n in non-negative integers x, y, m and n.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

2
12
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 9 publications
(14 citation statements)
references
References 27 publications
2
12
0
Order By: Relevance
“…where c and d are given positive integers, have been considered by several authors over the decades. In particular, there are many interesting results about the integer solutions of this equation for d = 1 and we direct the reader to the papers [2,7,13,16,17] for more information. For a survey on this very interesting subject we recommend [15,19].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…where c and d are given positive integers, have been considered by several authors over the decades. In particular, there are many interesting results about the integer solutions of this equation for d = 1 and we direct the reader to the papers [2,7,13,16,17] for more information. For a survey on this very interesting subject we recommend [15,19].…”
Section: Introductionmentioning
confidence: 99%
“…Let d ∈ {2, 3, 7, 11, 19, 43, 67, 163} and p > 41 be a prime. Then (d + p) p ≡ d (mod p) and we have: 3,7,11,19,43, 67, 163} and p > 41 be a prime such that d + p is also a prime. Then the Diophantine equation 11,15,19,35,39,43,51,55,67,91,95,111,115,123,155,163,183,187,195,203…”
Section: Introductionmentioning
confidence: 99%
“…The proof of Theorem 1.1 is now achieved by means of the following four lemmas. We only require the condition ( , , , ( , , , , , , ) ( , , , , , , 4 . From (3.1) we have .…”
Section: Proof Of Theorem 11mentioning
confidence: 99%
“…Case 3: = 55. Then ( 1 , 2 , 3 , 4 ) = (0, 1, 5, 4), (4, 1, 3, 4), (4, 5, 3, 4), (4, 5, 5, 2), (4,5,5,4). Equation (3.6) reduces to )︀ = −1.…”
Section: Proof Of Theorem 11mentioning
confidence: 99%
See 1 more Smart Citation