Re: FLT an incurable, unending addiction

In article <25136591.1133549815356.JavaMail.jakarta@xxxxxxxxxxxxxxxxxxxxxx> "Roman B. Binder" <rbinder@xxxxxxxxxxxxxxxx> writes:
....
I have to state that you do *not* clearly state what you are doing.
For the most part I do not understand at all what you are meaning.
It appears to be a language problem.

> I am sorry for not to point exactly my matter:
> I hope to work with the correct and approximately
> simple proof for FLT, also for questionable eq.:
> X^n + Y^n = Z^n once n prime >=3
> where X;Y;Z integers; then such set of integers could
> be extracted of any common factor and substituted with
> only natural values so let x;y<z and x;y;z of gcd=1
> now x^n + y^n = z^n could be eventually substituted
> with optional input: x=T+B; y=T+A; z=T+A+B
> where T;A;B natural numbers

You could just as well state that x <= y (or x < y as for x = y
there obviously is no solution). And so we can say y = x + a
and z = x + b, which makes everything shorter.

> what gives to us in brief:
> T^n = nAB(2T+A+B)*Ext

Now, this does not follow, I think. At least, it is not clear
how you get here.
--
*** t. winter, cwi, kruislaan 413, 1098 sj amsterdam, nederland, +31205924131
home: bovenover 215, 1025 jn amsterdam, nederland; http://www.cwi.nl/~***/
.