On the generalized Pillai equation a^x b^y=c

From MaRDI portal
Publication:852536



Abstract: In this paper we consider N, the number of solutions (x,y,u,v) to the equation (−1)urax+(−1)vsby=c in nonnegative integers x,y and integers u,vin0,1, for given integers a>1, b>1, c>0, r>0 and s>0. We show that Nle2 when gcd(ra,sb)=1 and min(x,y)>0, except for a finite number of cases that can be found in a finite number of steps. For arbitrary gcd(ra,sb) and min(x,y)ge0, we show that when (u,v)=(0,1) we have Nle3, with an infinite number of cases for which N=3.


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.











This page was built for publication: On the generalized Pillai equation \(\pm a^{x}\pm b^{y}=c\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q852536)