Re: FLT an incurable, unending addiction
- From: "Peter Allen" <peteronusenet@xxxxxxxxxxx>
- Date: Mon, 21 Nov 2005 20:23:02 -0000
fermat wrote:
> Hello to all those here with a bright mind and a friendly nature. Your
> fine works make the world a better place and are deeply appreciated by
> many folks here and around the world.
>
> The great FLT problem having been solved, but with a general proof
> intellectually inaccessible to many, it would seem that a simpler
> solution would be desireable. For example, I am wondering if it would
> be helpful, or significant, were a proof of the first case using only
> basic college algebra be presented here? (If such has not already been
> done, that is)
If by 'the first case' you mean e.g. n=3 or n=4 case, there are such simple
proofs; the n=4 proof is essentially due to Fermat, the n=3 (harder!) proof
is due to Euler. Use Google.
As to the general problem, yes, a simpler solution would be nice. But I am
not about to waste my life failing to find one when I have unsolved problems
to tackle, and I suspect most mathematicians will feel that way. So if there
ever is such a proof, it'll likely be a consequence of some mathematician
solving a problem and noticing an interesting corollary.
Peter
.
- Follow-Ups:
- Re: FLT an incurable, unending addiction
- From: *** T. Winter
- Re: FLT an incurable, unending addiction
- From: Dave Rusin
- Re: FLT an incurable, unending addiction
- From: Pubkeybreaker
- Re: FLT an incurable, unending addiction
- References:
- FLT an incurable, unending addiction
- From: fermat
- FLT an incurable, unending addiction
- Prev by Date: k-regular graphs
- Next by Date: Re: Subgroups of Z x Z
- Previous by thread: Re: FLT an incurable, unending addiction
- Next by thread: Re: FLT an incurable, unending addiction
- Index(es):
Loading