Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site CS-Arthur
Path: utzoo!watmath!clyde!burl!ulysses!mhuxr!mhuxn!ihnp4!inuxc!pur-ee!CS-Mordred!CS-Arthur!jwt
From: jwt@CS-Arthur (Jon W. Tanner)
Newsgroups: net.math
Subject: Re: Riemann Hypothesis (Actually Falting & Mordell Conjecture)
Message-ID: <1015@CS-Arthur>
Date: Thu, 22-Aug-85 11:15:36 EDT
Article-I.D.: CS-Arthu.1015
Posted: Thu Aug 22 11:15:36 1985
Date-Received: Sun, 25-Aug-85 05:42:26 EDT
References: <3129@nsc.UUCP> <616@petsd.UUCP>, <105@milford.UUCP>
Organization: Department of Computer Science, Purdue University
Lines: 11

> Has anyone seen the well publicized proof by Falting of
> Mordell's Conjecture?  This was supposed to be very close
> to establishing Fermat's Theorem, but I haven't heard much
> about it recently.

Gerd Faltings' proof of Mordell's conjecture has apparently been
accepted by the mathematical community, though I haven't seen it.  As a
particular application of Mordell's conjecture, there can be at most
finitely many solutions to the equation  x^n + y^n = z^n  in relatively
prime integers x, y, and z, for a given n > 3.  Fermat's "theorem"
claims that there are *no* solutions.