On the Diophantine equation \(ax^m-by^n=4\) (Q2742090)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the Diophantine equation \(ax^m-by^n=4\) |
scientific article; zbMATH DE number 1649709
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Diophantine equation \(ax^m-by^n=4\) |
scientific article; zbMATH DE number 1649709 |
Statements
20 September 2001
0 references
exponential Diophantine equations
0 references
On the Diophantine equation \(ax^m-by^n=4\) (English)
0 references
Let \(a\), \(b\), \(x\), \(y\) be integers such that \(a>0\), \(b>0\), \(x>1\) and \(y>1\). In this paper, using some elementary methods, the authors prove that the equation of the title has at most four integer solutions \((m,n)\) with \(m>1\) and \(n>1\).
0 references
