Re: A Proof by Faltings

Deep wrote:
In 1983 Gerald Faltings proved a theorem which in essence implies that
if the equation
x^n + y^n = z^n has nonzero integer solutions then the solutions set
must be finite. In other words if possible x, y, z can assume only
finite number of integer values. If it can be proved that that finite
number cannot be > 0 then the proof of Fermat's Last Theorem follows
immediately.
My question: Is my understanding of Falting's theorem correct? I would
appreciate some relevant references in English on this subject.

Afaik Faltings proved the Mordell conjecture and consequence of that
was that x^n+y^n=z^n can only be true for a finite amount x,y,z for n>2.
Though your interpretation seems to be correct.
Falting received the Fields medal for that result btw.

http://www-history.mcs.st-and.ac.uk/Biographies/Faltings.html
http://www-history.mcs.st-and.ac.uk/HistTopics/Fermat's_last_theorem.html#71
http://en.wikipedia.org/wiki/Mordell_conjecture
.

Relevant Pages

  • Re: A Proof by Faltings
    ... Is my understanding of Falting's theorem correct? ... Though your interpretation seems to be correct. ...
    (sci.math)
  • Re: A Proof by Faltings
    ... Best regards, ... Jose Carlos Santos ...
    (sci.math)
  • A Proof by Faltings
    ... In 1983 Gerald Faltings proved a theorem which in essence implies that ... Is my understanding of Falting's theorem correct? ... appreciate some relevant references in English on this subject. ...
    (sci.math)