

Contably infinite counterexamples to Fermat's Last Theorem
2005 Jul 02
... Fermat's Last Theorem
...

"To L. C. Young?s enrichment methodology is added this twin orientation: (a) the existence of longstanding unsolved scientific problem reveals the inadequacy of the underlying fields and (b) such problem is an opportunity and a catalyst for advancing those fields. This novel way of looking at a scientific problem has forged, in the course of its implementation, a new scientific methodology, the dynamic methodology, that has to its credit the resolution of Fermat's last theorem (FLT), the solution of the gravitational nbody problem, the development of the flux theory of gravitation and its adaptation to Earth, the theory of turbulence and the construction of the new reals. It is a superior alternative to the present descriptive pragmatic methodology of physics. Its main application here is the extension and clarification of including the construction of the countably infinite counterexamples to Fermat's last theorem."

In Defense of Mr. Fermat
2002 May 13
... Fermat's Last Theorem
...

"During the course of studies on the Goldbach Conjecture, using finite methods, what seems to be an elementary proof of Fermat's 'Last' Theorem has been found. Astonishing here is the lucidity of the arguments and immediacy of their logic. Hopefully, by (numeric) application to the socalled 'hard' problems of Number Theory, some manner of agreement (disputation) will arise."

Fermat's Last Theorem Proved and Award Offered for Refutation
2002 May 13
... Fermat's Last Theorem
...

"Here we will look at another method of simple proof of Fermat's Last Theorem (FLT) which was published in the booklet 'Fermat's Last Theorem Proved and Award Offered for Refutation' in 1990 with a supplement in 1994 which discussed many invalid but interesting criticisms. (This page will be available on the Internet for interest of mathematicians in seeing the proof, however for the Award conditions ( award valid till the end of 2003) and full discussion of criticisms readers are requested to Purchase the book.)"

A Search For Fermat's Lost Proof
2002 Jan 21
... Fermat's Last Theorem
...

"This is an initial search for the undiscovered proof of Fermat. ... Stay tuned."

Fermat's Last Theorem: The Solution
2001 Aug 11
... Fermat's Last Theorem
...

"In finding a proof of 'Fermat's Last Theorem' I limited myself to the tools available to Fermat himself, including the use of logic(expressed in terms of true and false ). This proof should convince even the most ardent devotees of Andrew Wiles, that he was wrong to insult Fermat by telling the world that Fermat was incapable of providing a proof to his own theorem. It is common knowledge that one can not make a large cube from the sum of 2 smaller cubes (consisting of unit cubes) and Fermat's Last Theorem merely extends this to higher powers."

Fermat's Last Theorem
2001 Jan 14
... Fermat's Last Theorem
...

Strange that only the n = 3 case is shown here, the solution to which has been known for quite some time.

Fermat's Theorem: Disproved
2000 Jul 02
... mathematics
. Fermat's Last Theorem
...

"I think Fermat succumbed to pressure when he claimed that he had found a proof, and I don't blame him. I mean, there's this theorem named after you, and they even tell you that it's the last one you're getting. Hell yeah, you're going to tell them you proved it. For years people have tried to show that Fermat's Last Theorem is true. Some have tried to show it was not untrue, and others have tried to show that it was notnotnot unfalse. It dawned upon me that no one had really tried to show that it was unnot notnotantinot untrue. When I looked at it this way, I immediately found that it was what I just said it was, and at that point I knew I had stumbled upon a great discovery."

Open Letter to Professor Wiles
2000 Mar 09
... mathematics
. Fermat's Last Theorem
...

"To me the [Fermat's last theorem] problem seems to be at the core of arithmetic  showing two operations (+) and (^) that are apparently too far apart for comfort, although (^) is repeated (.), which itself is repeated (+). So (^) is only one step beyond (.), yet one step too much for closure! ... Notice that (^) is not associative, nor commutative, nor does it distribute over (+). It is a highly nonconformist operation, despite its straightforward definition as repeated multiplication."

8
