关于丢番图方程ax+by=cz的研讨.pdfVIP

摘 要 1956年，Jesmanowicz 猜想对任意的正整数n , 若a ，6，c 是两两互素的正整数 且满足a2 + b2 = c2, 则丢番图方程(an)21 + (bn)y = (cn)z 仅有正整数解(尤，y, z) = (2, 2, 2 ) . 此猜想是有关毕达哥拉斯数组的重要的未解决问题之一.它吸引了许多 数学家的兴趣. 目前，已验证对许多具体的例子猜想是正确的. 本文主要工作分为三部分. 第一部分证明了对任意的正整数n , 丢番图 方程((Ffc - 2)n)x + (22k-1+1n )y = (Fkn 丫 仅有正整数解( r ,仏 z) = (2, 2, 2),其 中 Fk = 22k + 1 为第k 个Fermat 数. 第 二部分研宄 了 不定方程((16p2 - 1)n)x + (23pn)y = ((16p2 + 1)n)z, 其 中p 为奇素数. 并且证明了当P = 3, 7 时，方程仅有正整数解(;r,y,z) = (2, 2, 2). 具体地说，我们得到了如下结果：（i ) 对任意的正整数n , 丢番图方程(143打产+ (24n)y = (145n)z 仅有正整数解(r,y ,z) = (2, 2, 2); ( ii) 对任意的正整数n ,丢番图 方程(783nf + (56n)y = (785n)z 仅有正整数解(x, y,z) = (2, 2, 2). 第三部分证明了对任意的正整数n , 丢番图方程(195n)x + (28n)y = (197n)z 仅 有正整数解(：r,y ,z) = (2, 2, 2). 关键词：丢番图方程；同余；费马数 分类号 （2010 A M S ): 11D61. 万方数据 A b stract In 1956, Jesmanowicz conjectured that for any given positive integer n, if a, b, c are relatively prime positive integers such that a2 + b2 = c2, then the only solution of the Diophantine equation (an)x + (bn)y = (cn)z in positive integers is (x, y, z) = (2, 2, 2). This conjecture is one of the major unsolved problems about Pythagorean numbers. It has attracted the interest of many mathematicians. Up to now, it has been verified to be true in many special cases. The main results of this thesis are divided into three parts. In the first part, we prove that for any positive integer n, the Diophantine equation ((F^ — 2)n) + (22k 1 十1n )y = (Fkn)z has no solution other than (x, y, z) = (2, 2, 2), where Fk = 22 +1 is the k-th Fermat number. In the second part, we