A note on the diophantine equation \(ax^ m - by^ n = k\)
type: Item
instance of: scholarly article
title: A note on the diophantine equation \(ax^ m - by^ n = k\)
zbMATH Open document ID: 0762.11012
DOI: 10.1016/0019-3577(92)90007-8
author: Le Maohua
published in: Indagationes Mathematicae. New Series
publication date: 1992-12-15T00:00:00Z
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.
Mathematics Subject Classification ID: 11D61
Mathematics Subject Classification ID: 11J86
zbMATH DE Number: 78089
zbMATH Keywords: integer solutions
zbMATH Keywords: exponential diophantine equation
zbMATH Keywords: primitive divisors
zbMATH Keywords: linear forms in two logarithms
zbMATH Keywords: multiplicative relations in number fields
reviewed by: Bernd Richter
MaRDI profile type: Publication
full work available at URL: 0019-3577(92)90007-8
OpenAlex ID: W2055258277
cites work: On the Equation a x - b y = 1
cites work: Linear forms in two logarithms and Schneider's method. II
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
cites work: Q3739208
Recommended article: A note on the diophantine equation $(x^m-1)/(x-1) = y^n$
Recommended article: Q5475647
Recommended article: On the Diophantine equation |𝑎𝑥ⁿ-𝑏𝑦ⁿ|=1
Recommended article: Q4333104
Recommended article: Q3469167
Recommended article: A note on the Diophantine equation (anxm±1)/(anx±1)=yn+1
Recommended article: On the Diophantine equation \(ax+by=n\)
Recommended article: On the Diophantine equation \(ax^2+by^2=ck^n\)
Recommended article: A note on the diophantine equation (xm − l) / (x − 1) = yn + l
Recommended article: A note on the diophantine equation \((a^n-1)(b^n-1)= x^2\)
description: scientific article; zbMATH DE number 78089