0
大学数学基礎解説
文献あり

Optimized proof of Fermat's Last Theorem

560
0

When n is an odd prime

Let x, y, y and z be positive integers and y is a prime factor of zx. Let p be an odd prime. We suppose x, y and z are each prime to one another and y0 (mod p) holds. We consider the following equation.
xp+yp=zp ...(1)
yp=(zx)i=0p1zixp1i
Since z>x and zx0 (mod y) hold,
yp/(zx)pxp1 (mod y)
holds. The value on the right side is not 0 since x and y are relatively prime and y0 (mod p) holds. Let a and b be integers. We suppose yp=(ay+b)(zx) and b0 (mod y) hold since yp/(zx) is not a multiple of y.
zx0 (mod yp)
Therefore, yp=zx holds since yp/(zx) is an integer. Then, it becomes a contradiction since i=0p1zixp1i=1 holds. From the above, there are no integer solutions to the equation (1) for x>0, y>0 and z>0. (Q.E.D.)

When n=4 holds

Let x, y, y and z be positive integers and y is a prime factor of zx. We suppose x, y and z are each prime to one another and x is even and y and z are odd since there are no integer solutions to this equation when z is even. We consider the following equation.
x4+y4=z4 ...(2)
y4/(zx)=i=03zix3i
Since z>x and zx0 (mod y) hold,
y4/(zx)4x3 (mod y)
holds. The value on the right side is not 0 since x and y do not have common prime factors and y is odd. Let c and d be integers. We suppose y4=(cy+d)(zx) and d0 (mod y) hold since y4/(zx) is not divisible by y.
zx0 (mod y4)
Hence, y4=zx holds since y4/(zx) is an integer. And this is not proper since i=03zix3i=1 holds. From the above, there are no integer solutions to the equation (2) for x>0, y>0 and z>0. (Q.E.D.)

Conclusion

By the proof when n is an odd prime and when n is 4 as above, when n3 holds, xn+yn=zn does not have an integer solution for x>0, y>0 and z>0.

参考文献

投稿日:29
OptHub AI Competition

この記事を高評価した人

高評価したユーザはいません

この記事に送られたバッジ

バッジはありません。
バッチを贈って投稿者を応援しよう

バッチを贈ると投稿者に現金やAmazonのギフトカードが還元されます。

投稿者

コメント

他の人のコメント

コメントはありません。
読み込み中...
読み込み中
  1. When n is an odd prime
  2. When n=4 holds
  3. Conclusion
  4. 参考文献