Re: Computability
- From: The Dougster 22044 <DGoncz@xxxxxxxxxxxx>
- Date: Tue, 8 Jan 2008 14:33:07 -0800 (PST)
So.
From x^p + y^p = z^p we have many statements in MA. Much of whatfollows was shown to me here in sci.math.
x^p + y^p == 0 mod z
x^p / y^p == 1 mod z
(x/y)^p == 1 mod z
and so y is an invertible member of Z.z*. Likewise (E means Exists)
E /x in Z.z*, /x in Z.y*, /(z mod y) in Z.y*,
E /(z mod x) in Z.x*, /(y mod x) in Z.x*.
Hm. Look at all the invertible elements. Looks like we have ring
theory now, not just group theory.
In words, x,y, and z must each be invertible in each other's rings,
and share no common factor pairwise.
Doug
.
- Follow-Ups:
- Re: Computability
- From: The Dougster 22044
- Re: Computability
- References:
- Computability
- From: The Dougster 22044
- Re: Computability
- From: Joshua Cranmer
- Re: Computability
- From: The Dougster 22044
- Re: Computability
- From: Robert Israel
- Re: Computability
- From: The Dougster 22044
- Computability
- Prev by Date: derivation of the greek letters
- Next by Date: Re: Geometry with difficult ....
- Previous by thread: Re: Computability
- Next by thread: Re: Computability
- Index(es):
Relevant Pages
|
Loading