Math 2.0

Number theory Diophantine equations Theorem

Fermat's Last Theorem for n = 4

Builds on Fermat's right triangle theoremProof by infinite descent

Statement

There are no positive integers aa, bb and cc with a4+b4=c4a^4 + b^4 = c^4.

Remarks

A stronger statement holds: x4+y4=z2x^4 + y^4 = z^2 has no solution in positive integers. The theorem also follows from Fermat's right triangle theorem, in the form that x4−y4=z2x^4 - y^4 = z^2 has no solution in positive integers. The proof uses infinite descent and the classification of Pythagorean triples. Since 44 divides every power of 22 above 22, the case n=4n = 4 settles Fermat's Last Theorem for all such exponents.

History

Fermat's proof of his right triangle theorem, by infinite descent, gives this case.

Reading path

To understand this page from the ground up, read these 6 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Divisibility definition
  2. Proof by infinite descent concept
  3. Greatest common divisor definition
  4. Pythagorean triple definition
  5. Fermat's right triangle theorem statement
  6. Fermat's Last Theorem for n = 4 statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Proof_of_Fermat%27s_Last_Theorem_for_specific_exponents, n = 4
About this page
Tag0E741HSMJ1
URIm2://0E741HSMJ1
Kindstatement, theorem
WritingW0 stub
MSC11D25
StatusThis copy of the site has no build data. Run m2 status 0E741HSMJ1.
UsesFermat's right triangle theorem, Proof by infinite descent

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.