Re: SIGNIFICANT SIMPLIFICATION of FLT and BEAL's conjectures

On Sep 1, 6:14 am, "Roman B. Binder" <rbin...@xxxxxxxxxxxxxxxx> wrote:
Hi,
For the first I should apologize again for the
serial of my faulty developments as above.
Nowadays it seems for me clear,
that Beal's conjecture for integers of gcd=1
could be solved with the help of especially
retrieved equations which consists similar forms
as certain retrieved equations for FLT conjecture.
There is to be taken only, that FLT conjecture was
solved properly from n=3,4 and next to all bigger primes...
On the other way it could be seen some possible
much more simple proof for FLT conjecture:
Only, if there it is to consider no integer solutions
for A^2 -B^2 = n(x^2 -y^2) for x;y of gcd=1
n as prime number from n=3 and A;B appropriate
integers !!!
How it can be done in details ?
I hope my surprise will hold and be patient
as I'll fight now with some highest authorities...

The Best Regards
Ro-Bin

Yes, "retrieve" those equations, you nearly incomprehensible crank!

And fight fight fight "some highest authorities".

Crank.

.

Relevant Pages
Loading