On the generalized Pillai equation \(\pm a^{x}\pm b^{y}=c\) (Q852536): Difference between revisions

The authors consider the generalized Pillai (Diophantine) equation \[ \varepsilon_1 a^x + \varepsilon_2 b^y=c, \quad \varepsilon_1, \varepsilon_2 \in \{-1,+1\}, \quad a, b>1,\;c >0. \leqno \text{ (i)} \] In the case \(\varepsilon_1=1\) and \(\varepsilon_2=-1\), M. Bennett proved that there are at most two solutions \((x,y)\) for any given triple \((a,b,c)\). Here, the authors get the same result for the solutions \((x,y,\varepsilon_1,\varepsilon_2)\) of equation (i). They also solve completely some special cases of equation (i) or of the more general equation \[ | a^{x_1} - b^{y_1}| = | a^{x_2} - b^{y_2}| . \] One of the tools of the proofs is a lower bound of linear forms in two logarithms.