First case of Fermat's Last Theorem
From Infogalactic: the planetary knowledge core
(Redirected from First case of Fermat's last theorem)
The first case of Fermat's last theorem says that for three integers x, y and z and a prime number p, where p does not divide the product xyz, there are no solutions to the equation xp + yp + zp = 0.
Using the Theorem of unique factorization of ideals in Q(ξ) it was shown that if the first case has solutions x, y, z, then x+y+z is divisible by p and (x, y), (y, z) and (z, x) are elements of Hp, where Hp denotes a set of pairs of integers with special properties.[1]
Notes
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
References
- Lua error in package.lua at line 80: module 'strict' not found.
- Lua error in package.lua at line 80: module 'strict' not found.
- Lua error in package.lua at line 80: module 'strict' not found.
- Lua error in package.lua at line 80: module 'strict' not found.
- Lua error in package.lua at line 80: module 'strict' not found.
- Lua error in package.lua at line 80: module 'strict' not found.