期刊文献+

THE PROOF OF FERMAT'S LAST THEOREM

THE PROOF OF FERMAT'S LAST THEOREM
下载PDF
导出
摘要 i) Instead of x ̄n+ y ̄n = z ̄n ,we use as the general equation of Fermat's Last Theorem (FLT),where a and b are two arbitrary natural numbers .By means of binomial expansion ,(0.1) an be written as Because a ̄r-(-b) ̄r always contains a +b as its factor ,(0.2) can be written as where φ_r =[a ̄r-(-b) ̄r]/ (a+b ) are integers for r=1 . 2, 3. ...n (ii) Lets be a factor of a+b and let (a +b) = se. We can use x= sy to transform (0.3 ) to the following (0.4)(iii ) Dividing (0.4) by s ̄2 we have On the left side of (0.5) there is a polynomial of y with integer coefficient and on the right side there is a constant cφ/s .If cφ/s is not an integer ,then we cannot find an integer y to satisfy (0.5), and then FLT is true for this case. If cφ_n/s is an integer ,we may change a and c such the cφ_n/s≠an integer . i) Instead of x ̄n+ y ̄n = z ̄n ,we use as the general equation of Fermat's Last Theorem (FLT),where a and b are two arbitrary natural numbers .By means of binomial expansion ,(0.1) an be written as Because a ̄r-(-b) ̄r always contains a +b as its factor ,(0.2) can be written as where φ_r =[a ̄r-(-b) ̄r]/ (a+b ) are integers for r=1 . 2, 3. ...n (ii) Lets be a factor of a+b and let (a +b) = se. We can use x= sy to transform (0.3 ) to the following (0.4)(iii ) Dividing (0.4) by s ̄2 we have On the left side of (0.5) there is a polynomial of y with integer coefficient and on the right side there is a constant cφ/s .If cφ/s is not an integer ,then we cannot find an integer y to satisfy (0.5), and then FLT is true for this case. If cφ_n/s is an integer ,we may change a and c such the cφ_n/s≠an integer .
作者 汪家訸
出处 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 1996年第11期1031-1038,共8页 应用数学和力学(英文版)
关键词 FACTORIZATION COFACTOR relative prime gcd combination.algebraic division. Fermat's Last Theorem factorization, cofactor , relative prime, gcd, combination.algebraic division. Fermat's Last Theorem
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部