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

From MaRDI portal
Publication:852536

DOI10.1016/J.JNT.2005.09.001zbMATH Open1146.11020arXiv1102.4834OpenAlexW2047351779WikidataQ56226409 ScholiaQ56226409MaRDI QIDQ852536FDOQ852536


Authors: Reese Scott, Robert Styer Edit this on Wikidata


Publication date: 15 November 2006

Published in: Journal of Number Theory (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1102.4834




Recommendations




Cites Work


Cited In (14)





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)