Abstract
The diophantine equation x3 - 3xy2 - y3 = ± 3n017n119n2 is completely solved as follows. First, a large upper bound for the variables is obtained from the theory of linear forms in p-adic and real logarithms of algebraic numbers. Then this bound is reduced to a manageable size by p-adic and real computational diophantine approximation, based on the L3-algorithm. Finally the complete list of solutions is found in a sieving process. The method is in principle applicable to any Thue-Mahler equation, as the authors will show in a forthcoming paper.
| Original language | English |
|---|---|
| Pages (from-to) | 799-815 |
| Number of pages | 17 |
| Journal | Mathematics of computation |
| Volume | 0 |
| Issue number | 57 |
| DOIs | |
| Publication status | Published - 1991 |
Fingerprint
Dive into the research topics of 'Solving a specific Thue-Mahler equation'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver