首页 | 本学科首页   官方微博 | 高级检索  
     检索      


On the Diophantine equation
Authors:Michael A Bennett  Benjamin M M de Weger
Institution: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 $ a, b $ and $ n $ are positive integers with $ b \geq a $ and $ n \geq 3 $, then the equation of the title possesses at most one solution in positive integers $ x $ and $ y $, with the possible exceptions of $ ( a, b, n ) $ satisfying $ b = a + 1 $, $ 2 \leq a \leq \min \{ 0.3 n, 83 \} $ and $ 17 \leq n \leq 347 $. 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》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号