On the Diophantine equation ![]() |
| |
Authors: | Michael A. Bennett Benjamin M. M. de Weger. |
| |
Affiliation: | Department of Mathematics, University of Michigan, Ann Arbor, Michigan 48109 ; Mathematical Institute, University of Leiden, Leiden, The Netherlands, and Econometric Institute, Erasmus University Rotterdam, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands |
| |
Abstract: | ![]() If and are positive integers with and , then the equation of the title possesses at most one solution in positive integers and , with the possible exceptions of satisfying , and . The proof of this result relies on a variety of diophantine approximation techniques including those of rational approximation to hypergeometric functions, the theory of linear forms in logarithms and recent computational methods related to lattice-basis reduction. Additionally, we compare and contrast a number of these last mentioned techniques. |
| |
Keywords: | |
|
| 点击此处可从《Mathematics of Computation》浏览原始摘要信息 |
|
点击此处可从《Mathematics of Computation》下载全文 |
|