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

DOI10.1016/0019-3577(92)90007-8zbMath0762.11012OpenAlexW2055258277MaRDI QIDQ1196261

Maohua Le

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

integer solutionsexponential diophantine equationlinear forms in two logarithmsprimitive divisorsmultiplicative relations in number fields

Mathematics Subject Classification ID

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

Related Items (6)

A note on the number of solutions of the Pillai type equation \(| a^x - b^y | = k\) ⋮ The number of solutions to the generalized Pillai equation \(\pm ra^{x} \pm sb^{y}=c\). ⋮ ON THE NUMBER OF SOLUTIONS OF THE DIOPHANTINE EQUATIONax^m−byⁿ=c ⋮ Number of solutions to \(ka^x+lb^y=c^z\) ⋮ The generalized Pillai equation \(\pm ra^x\pm sb^y=c\) ⋮ On the number of solutions of Goormaghtigh equation for given \(x\) and \(y\)

Cites Work

• Unnamed Item
• Linear forms in two logarithms and Schneider's method. II
• Computing the effectively computable bound in Baker's inequality for linear forms in logarithms, and: Multiplicative relations in number fields: Corrigenda and addenda
• On the Equation a x - b y = 1

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