A note on the diophantine equation ax^ m - by^ n = k

DOI10.1016/0019-3577(92)90007-8MaRDI QIDQ1196261zbMATH OpenOpenAlexFDO

Authors Le Maohua

Publication date 15 December 1992

Published in Indagationes Mathematicae. New Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0019-3577(92)90007-8

zbMATH Keywords

exponential diophantine equationinteger solutionslinear forms in two logarithmsmultiplicative relations in number fieldsprimitive divisors

Mathematics Subject Classification ID

Exponential Diophantine equations (11D61) Linear forms in logarithms; Baker's method (11J86)

Review text

Let \(a,b,k,x,y\) be positive integers with \(x,y>1\), \(\text{gcd}(ax,by)=1\). The author considers the number \(N\) of integer solutions \((m,n)\) with \(m,n>1\) of the exponential diophantine equation \[ ax^ m-by^ n=k. \] It was known to \textit{W. J. LeVeque} [Am. J. Math. 74, 325-331 (1952; Zbl 0047.041)] that \(N\leq 1\) for \(a=b=k=1\) (Catalan's equation). \textit{Z.-F. Cao} [Kexue Tongbao 35, 558-559 (1990)] proved that \(N\leq 4\) for \(k\leq 2\). In general, \textit{T. N. Shorey} [Indagationes Math. 48, 353-358 (1986; Zbl 0603.10019)] has shown that \(N\leq 9\) if \(a\) \(x^ m>953 k^ 6\). The author proves the following results: (a) If \(\min(a,b)=k=1\), then \(N\leq 1\). (b) If \(a=b=1\) and \(\min(x,y)\geq 10^ 5\), then \(N\leq 2\). (c) If \(\min(x,y)\geq e^ e\), then \(N\leq 3\). Thereby it follows: (a) elementarily from the classical results of Birkhoff-Vandiver on primitive divisors of \(X^ r-Y^ r\), (b) from Mignotte-Waldschmidt's theorem on linear forms in two logarithms, and (c) from van der Poorten-Loxton's considerations of multiplicative relations in number fields.

Recommendations

• A note on the diophantine equation (x^m-1)/(x-1) = y^n
• scientific article; zbMATH DE number 5036182
• On the Diophantine equation |𝑎𝑥ⁿ-𝑏𝑦ⁿ|=1
• scientific article; zbMATH DE number 979923
• scientific article; zbMATH DE number 4136033
• A note on the Diophantine equation (aⁿx^m±1)/(aⁿx±1)=yⁿ+1
• On the Diophantine equation ax+by=n
• On the Diophantine equation \(ax^2+by^2=ck^n\)
• A note on the diophantine equation (x^m − l) / (x − 1) = yⁿ + l
• A note on the diophantine equation \((a^n-1)(b^n-1)= x^2\)

Cites work

• Computing the effectively computable bound in Baker's inequality for linear forms in logarithms, and: Multiplicative relations in number fields: Corrigenda and addenda
• scientific article; zbMATH DE number 3972955 (Why is no real title available?)
• Linear forms in two logarithms and Schneider's method. II
• On the Equation a x - b y = 1

Cited in

(16)

• Number of solutions to \(ka^x+lb^y=c^z\)
• The number of solutions to the generalized Pillai equation \(\pm ra^{x} \pm sb^{y}=c\).
• On the number of solutions of Goormaghtigh equation for given \(x\) and \(y\)
• A note on the number of solutions of the Pillai type equation \(| a^x - b^y | = k\)
• A note on the Diophantine equation
• scientific article; zbMATH DE number 4136033 (Why is no real title available?)
• ON THE NUMBER OF SOLUTIONS OF THE DIOPHANTINE EQUATIONax^m−byⁿ=c
• scientific article; zbMATH DE number 5528976 (Why is no real title available?)
• scientific article; zbMATH DE number 3972955 (Why is no real title available?)
• A note on the diophantine equation ${k\choose 2}-1=q^n+1$
• A remark on the solvability of a Diophantine matrix equation over \(M_2(\mathbb Q)\)
• A note on the equation $ax^n - by^n = c$
• The generalized Pillai equation \(\pm ra^x\pm sb^y=c\)
• scientific article; zbMATH DE number 5036182 (Why is no real title available?)
• Skolem’s conjecture confirmed for a family of exponential equations, II
• Number of solutions to a special type of unit equations in two unknowns. III

This page was built for publication: A note on the diophantine equation \(ax^ m - by^ n = k\)

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