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

An upper bound for the number of solutions of ternary purely exponential Diophantine equations II

Abstract: Let a, b, c be fixed coprime positive integers with min{a, b, c} > 1. In this paper, by analyzing the gap rule for solutions of the ternary purely exponential diophantine equation a x + b y = c z , we prove that if max{a, b, c} ≥ 10 62 , then the equation has at most two positive integer solutions (x, y, z).(x, y, z) of (1.1). As a straightforward consequence of an upper bound for the number of solutions of binary S−unit equations due to F. Beukers and H. P. Schlickewei [2], we have N(a, b, c) ≤ 2 36 . In near… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
11
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
3

Relationship

3
5

Authors

Journals

citations
Cited by 9 publications
(11 citation statements)
references
References 5 publications
(6 reference statements)
0
11
0
Order By: Relevance
“…The proof of this proposition is achieved by the combination of Baker's method in both complex and p-adic cases together with improving the gap principle established by Hu and Le [HuLe,HuLe2,HuLe3] arising from the existence of three hypothetical solutions as well as a certain 2-adic argument relying upon the striking result of Scott and Styer [ScSt2]. From the viewpoint of the generalized Fermat equation (cf.…”
Section: Introductionmentioning
confidence: 99%
“…The proof of this proposition is achieved by the combination of Baker's method in both complex and p-adic cases together with improving the gap principle established by Hu and Le [HuLe,HuLe2,HuLe3] arising from the existence of three hypothetical solutions as well as a certain 2-adic argument relying upon the striking result of Scott and Styer [ScSt2]. From the viewpoint of the generalized Fermat equation (cf.…”
Section: Introductionmentioning
confidence: 99%
“…LEMMA 2.1. If c is an odd prime, then, for a given parity class, there is at most one solution (x, y, z) to (1.1), except for (a, b, c) = (3, 10, 13) or (10,3,13).…”
Section: Preliminariesmentioning
confidence: 99%
“…By combining the Gel'fond-Baker method with an elementary approach, Hua and Le [15] proved that if max{a, b, c} > 5 × 10 27 , then the equation a x + b y = c z has at most three positive integer solutions (x, y, z). Moreover they showed that if max{a, b, c} ≥ 10 62 , then the equation (1.1) has at most two solutions in positive integers x, y and z [16]. It seems that the latter result holds with no restriction on values a,b and c. Scott and Styer made even a stronger conjecture, i.e.…”
Section: Introductionmentioning
confidence: 98%