[Search for users] [Overall Top Noters] [List of all Conferences] [Download this site]

Conference rusure::math

Title:Mathematics at DEC
Moderator:RUSURE::EDP
Created:Mon Feb 03 1986
Last Modified:Fri Jun 06 1997
Last Successful Update:Fri Jun 06 1997
Number of topics:2083
Total number of notes:14613

206.0. "Fermat's Last Theorem" by LATOUR::AMARTIN () Wed Jan 09 1985 09:39

Date: Monday, 7 January 1985  13:23-EST
From: CSMITH at MRFORT

Newsgroups: net.math
Path: decwrl!decvax!ittvax!dcdwest!sdcsvax!akgua!psuvax1!parker
Subject: Re: Fermat's Last Theorem
Posted: Thu Jan  3 18:44:16 1985


The abstract reads in full:

816-11-188	CHIEN WENJEN, 4297 Candleberry Avenue, Seal Beach, CA 90740.
		"Fermat's Last Theorem".  Preliminary Report

    The missing proof of Fermat's Last Theorem has been rediscovered.
The proof is elementary, zigzag, and truly wonderful as claimed by Fermat
nearly three and a half centuries ago.  The relation
 p    p    p
x  + y  = z for any prime p > 2 is called Case I if none of the solution
integers x, y, z is divisible by p and Case II if one of the integers is
divisible by p.  In this article, unlike the classical work, we show
first the nonexistence of Case II and the the impossibility of Case I.
[Harold M. Edwards, "Fermat's Last Theorem - A Genetic Introduction to
Algebraic Number Theory," or L. J. Mordell, "Three Lectures on
Fermat's Last Theorem," and "13 Lectures on Fermat's Last Theorem" by
Paulo Ribenboim.]

It's to be presented as part of the AMS annual meeting 9-13 Jan 85.
-- 
Bruce Parker
Computer Science Department		(814) 863-1545
334 Whitmore Lab			{allegra|ihnp4}!psuvax1!parker
The Pennsylvania State University	parker@penn-state	(csnet)
University Park, Pennsylvania 16802	parker@psuvax1		(bitnet)
T.RTitleUserPersonal
Name
DateLines
206.1METOO::YARBROUGHWed Jan 09 1985 11:5512
While we are waiting to see the proof of the general case, you might want 
to warm up on this (much simpler) version of the problem:

Assuming x, y, z, and n are natural numbers, and n >= z, prove that

	 n    n    n
	x  + y  = z

has no solution.

(If you want you can find the proof in Hugo Steinhaus's "One Hundred 
Problems in Elementary Mathematics".)
206.2HARE::STANWed Jan 09 1985 19:162
I'm leaving tormorrow for the Math Convention.  Hope to get the scoop.
Be back Tuesday to report.
206.3TAV02::NITSANSun Jan 13 1985 00:5714
Re .1:

         n    n    n
Assume: a  + b  = c , a<=b<c . Now define  s=b/a, t=c/a  (both >= 1).

 n     n    n            n    n            n    n           n    i-1 n-i
a  +  b  = c   ==>  1 + s  = t   ==>  1 = t  - s  = (t-s) SIGMA t   s    >=
                                                           i=1
           n
>= (t-s) SIGMA 1 = (t-s)n  ==>  1 >= (t-s)n  ==>  a >= (c-b)n  ==>  a>=n
          i=1

(Note that we actually got stronger results...)
                                                      NITSAN
206.4HARE::STANMon Jan 14 1985 22:353
I just got back from the convention.

Fermat's last theorem is still open.
206.5ORPHAN::BRETTTue Jan 15 1985 22:264
What went wrong Stan?  Hoax or 'if this is true (which it obviously is)'?

/Bevin
206.6HARE::STANWed Jan 16 1985 04:304
I wasn't at the session (it was a 10 minute talk), but I inquired
about it and was told it was by a "crank".  They get 1 or 2 of
these talks every year.  Any member of the AMS may give a 10-minute
talk; there is no refereeing.
206.7HARE::STANThu Jan 17 1985 01:0927
From:	ROLL::USENET       "USENET Newsgroup Distributor" 17-JAN-1985 00:33
To:	HARE::STAN
Subj:	USENET net.math newsgroup articles

Newsgroups: net.math
Path: decwrl!decvax!bellcore!allegra!ulysses!mhuxr!mhuxj!houxm!ihnp4!arizona!gary
Subject: Re: "Proof" of Fermat's Last Theorem
Posted: Mon Jan 14 19:46:56 1985

I attended the MAA part of the joint AMS/MAA meeting where the
paper was to be presented.  (I am a faculty member of the
Institute for Retraining in Computer Science and had a couple
of presentations to make.)

I arrived too late to hear the presentation, but the
mathematicians that I knew said that it was a very
uncomfortable situation.  The author suffers from some
condition that has left him unable to speak or walk.  His wife,
who apparently spoke little English and knew no mathematics,
was presenting the paper.  She read the abstract and that was
it.  On being asked if there was a pre-print available, she
said ``No.''

My guess is that the problem is still open.
-- 
Gary Levin / Dept of CS / U of AZ / Tucson, AZ 85721 / (602) 621-4231