Revision #137 → #1214 · back to history
addedFermat's Last Theorem (statement)c825b5727fa0
addedCases n=1, n=2 have infinitely many solutions54286405c538
addedPythagorean equation has infinitely many solutions52ec1de48bc3
addedFermat's general equation has no solutions for n>2c3533a77eef5
addedReduction to prime exponents6f990f1abb42
addedTrivial and non-trivial solution55d5749704bc
addedOriginal statement of FLT2853150be70e
addedEquivalent statement 1 (over the integers)4aae2bc2df8f
addedEquivalent statement 2 (over the rationals)b767dd87848e
addedEquivalent statement 3 (curve form)737294ba741e
addedEquivalent statement 4 (Frey curve / elliptic curves)2e4741d192fa
addedPythagorean theorem21d710d971e5
addedPythagorean triplec0ee6c87765f
addedInfinitely many Pythagorean triples6ac86b746573
addedExample Pythagorean triples48ad271935d1
addedDiophantine equatione75adb82d0f5
addedTypical Diophantine problem0334a56321d9
addedSolutions of x²+y²=z² are Pythagorean triples3927078c3eb3
addedLinear Diophantine equation via Euclidean algorithm74fb1b7a731e
addedInfinitely many solutions for coprime exponentsc3af74d5023f
addedArithmetica Problem II.89fc0fcf53c86
addedDiophantus's sum-of-squares solution for k=4ad78eaf58a27
addedFermat's marginal statement of FLTff60f1fd42a3
addedRight triangle area not a perfect square321e49b8db7e
addedFermat's Last Theorem for n = 48d4122cd1664
addedReduction to odd prime exponents6e85303752bb
addedFLT for p = 3 (Euler)061994bc916e
addedFLT for p = 5 (Legendre, Dirichlet)5fc3922d5eea
addedFLT for p = 7 (Lamé)288de75b1646
addedFLT for n = 6, 10, 1414a6fb381bc9
addedSophie Germain auxiliary primes9ed4152f1c19
addedNon-consecutivity condition implies θ divides xyz0a3c680ae010
addedSophie Germain's theoremec4e0fd4f4fd
addedSophie Germain primes2101a23b4a4f
addedFirst case of FLT for n = 2p (Terjanian)0f3b1f5ec751
addedFirst case of FLT for infinitely many odd primesd6fa24325215
addedKummer's theorem for regular primes3369432d7e25
addedIrregular primes below 2706982256c7d09
addedMordell conjecture / Faltings' theoreme322c0e1ba25
addedFLT verified up to 2521 (Vandiver)9178c4f0041f
addedFLT verified below 125,000 (Wagstaff)b9e0389e285b
addedFLT verified below four million094ec5584c66
addedModularity theoremd36307e2effd
addedFrey curve unlikely to be modulara813e5caade7
addedRibet's theoremdc6f36251807
addedWiles's modularity theorem for semistable curves5cd4fee81267
addedNo cube is a sum of two coprime nth powers97e552c1de1a
addedFermat equation16035349778a
addedGeneralized Fermat equation24b8ada99fa8
addedBeal conjectureba5c3f5011d0
addedFermat–Catalan conjecturecbec1f3655ec
addedSolutions of the inverse Fermat equation21d934300899
addedRational-exponent solutions (Bennett, Glass, Székely)75331f495fe2
addedSolutions of the optic equation (n = −1)ac523f656c4a
addedInfinitude of solutions for n = −2ac2b5ded6783
addedGeometric interpretation of n = −2 solutionsa5b44ad0220f
addedNo solutions for n < −205539a7e0af0
addedabc conjectureb286d43ab1ef
addedabc conjecture implies FLT for large nacbcdcf26620
addedSimpsons near-counterexample215ddfb453d0