Re: Proof Attempt For Fermat's Last Theorem

Am 15.03.2007 07:24 schrieb jiahao_anti-addictgamer@xxxxxxxxxxx:
On Mar 15, 2:21 pm, "Tonico" <Tonic...@xxxxxxxxx> wrote:
On 14 mar, 16:09, jankri...@xxxxxxxxxxx wrote:> On 14 Mar, 10:13, jiahao_anti-addictga...@xxxxxxxxxxx wrote:

On Mar 14, 4:26 pm, "Tonico" <Tonic...@xxxxxxxxx> wrote:
***************************************
Hope no more: you ARE mistaken.
Tonio
The proof has been sent . Whether it is flawless or not , it all
depends on Jay to verify it now .
Flawed, as expected. :-)
I have e-mailed the refutation.
********************************
I'm shocked! A flawed proof of FLT by a math fan BUT NOT a
mathematician, who also loves to gossip about how REAL mathematicians
behave/research/work?? Nooooooo....really???!!!! That hardly
happens....what, some 4-5 times ONLY in the last 3-4 months and ONLY
in the NG??
Anyway, when I wrote "hope no more...etc." I was in fact refering to
Bassam, not to Jiahao...
Regards
Tonio
Pd. BTW, it seems to have been a rather gross flaw and in the first
page, uh? I mean, from what I read....I haven't seen the paper, though.

I have made the hard desciion of presenting my paper to everyone .
It may put me in the deepest shame but this will not ruin my passion
for mahematics .
Besides , when Wiles was young , he too had many flawed proofs . It
takes time to learn from your mistakes and finally suceed .

I propose to start studying

p p p q1 q2 q3
x - y = z = (x-y) Q1 Q2 Q3 ...

in terms of primefactorization (where Q1,Q2,... are primes),
considering the question: what can I know about the possible
primefactors and the possible exponents. Then also about the
primefactors of (x-y): can this have some prime-factors of
the set Q1,Q2,Q3,... ? Has p a special role? (Note, if
the Q-primefactors are not in (x-y), they all must have the
same exponent q1=q2=q3=p, if they are, the sum of their
exponents in the two partial-products must equal p)

When I started with this questions I stepped into many
very interesting fields with many open questions, like Mersenne
numbers, squarefreeness of Mersenne numbers, Sophie Germain-primes,
cyclotomic polynomials, the catalan problem (a^p - 1^p =?= b^q)
and always, after I found a "pattern" and then a rule, I also
found exciting articles in the internet and in the library,
where true explorative minds had already considered these
problems and often had beautiful approaches and proofs, Euler,
Szygmondi (? spell) to mention only two. The dead end for me was
then the problem of the difficult properties of Wieferich primes,
(and the possibility of double wieferich pairs) and the general
description for their occurence and their degree (which seems
still out of reach in NT)).

Although this path seems not to be successful for FLT, one can
learn a lot about similar problems. And with the concept of
cyclic subgroups many diophantine exponential problems can
easily be solved, even on high-school level.

So my proposal is: try to find applicable rules for the
occurence of powers of primes for expressions like
n n
x - y
based on varying n, not only primes, (if you did not already
study this). Apply that rules to interesting well known problems
like Mersenne-numbers, Catalan and the like to find the limit
of their explanatory power. For me I dealt with this about a year
(as an about-amateur from the scratch) and that was full with
adventure, discovery and learning.

Happy mathing -

Gottfried Helms

.

Relevant Pages

  • Re: numbers n with large sum of divisors compared to n
    ... The ratio sigma/n can grow with n, ... Since the product over all primes ... This means that by adjusting the exponents of the prime factors of n, ... Using and the multiplicativity of sigma/n, ...
    (sci.math)
  • Re: numbers n with large sum of divisors compared to n
    ... The ratio sigma/n can grow with n, ... Since the product over all primes ... This means that by adjusting the exponents of the prime factors of n, ... Using and the multiplicativity of sigma/n, ...
    (sci.math)
  • Re: gnupg rsa question // why use e of 41 ?
    ... but not if you use proper padding. ... But implementations do have mistakes. ... source code indicates a developer who didn't understand these issues ... All he needed to know is that smaller exponents might be more risky ...
    (sci.crypt)
  • Re: Hardness of DDH with short exponents
    ... guarantee privacy in their "Direct Anonymous Attestation" protocol. ... They use non-shifted but shortened exponents (split into two parts, ... Sounds equivalent if the group order |G| is known and odd. ... of safe primes is less efficient it does not really matter here, ...
    (sci.crypt)
  • Re: Factoraization of n! as power of primes
    ... I thought the original poster wanted to obtain BOTH the list of primes ... and their exponents. ... factorization of n! ... super-linear in n (and fancier sieve methods exist that are mildly ...
    (sci.math)