Bennett's Pillai theorem with fractional bases and negative exponents allowed (Q259512)

\textit{M. A. Bennett} [Can. J. Math. 53, No. 5, 897--922 (2001; Zbl 0984.11014)] proved that for any positive integers \(a,b,c\) with \(a\geq 2\), \(b\geq 2\), the equation \(a^x-b^y=c\) has at most two solutions in positive integers \(x,y\). In the present paper the authors extend this result to rational bases, and (not necessarily positive) integer exponents. First they prove that the equation has at most two solutions also in non-negative integers \(x,y\), except for the case \((a,b,c)=(2,5,3)\) when the equation allows three solutions. Then they show that for any positive rational numbers \(A,B,C\) with \(A\neq 1\), \(B\neq 1\) the equation \(A^x-B^y=C\) also has only at most two solutions in arbitrary integers \(x,y\), except for two, explicitly given families of equations, when there are three solutions. Some infinite families of the equation having precisely two solutions are also exhibited. In the Appendix the authors solve in an elementary way the equation \(p^r\pm p^s +1=z^2\), where \(z,r,s\) are positive integers with \(r\neq s\) and \(p\) is an odd prime. This equation was solved earlier by \textit{F. Luca} [Acta Arith. 112, No. 1, 87--101 (2004; Zbl 1067.11016)].