Canadian Journal of Mathematics · 2001 · 55 citations · 10 references
Natural SciencesMathematicsDiscrete MathematicsNumber TheoryTheory Of ComputationAlgebraic Number TheoryDiophantine EquationsDiophantine Equation SolvingExponential Diophantine EquationsExponential EquationsLinear Diophantine EquationsLower Bounds
Abstract In this paper, we establish a number of theorems on the classic Diophantine equation of S. S. Pillai, a x – b y = c , where a , b and c are given nonzero integers with a , b ≥ 2. In particular, we obtain the sharp result that there are at most two solutions in positive integers x and y and deduce a variety of explicit conditions under which there exists at most a single such solution. These improve or generalize prior work of Le, Leveque, Pillai, Scott and Terai. The main tools used include lower bounds for linear forms in the logarithms of (two) algebraic numbers and various elementary arguments.
10
R. Tijdeman · Acta Arithmetica · 1976 · 93 citations · Full text
The equation x+y=1 in finitely generated groups
Frits Beukers, Hans Peter Schlickewei · Acta Arithmetica · 1996 · 69 citations · Full text
Aaron Herschfeld · Bulletin of the American Mathematical Society · 1936 · 45 citations · Full text
On the Equations px − by = c and ax + by = cz
Reese Scott · Journal of Number Theory · 1993 · 40 citations