News about my1965 Proof of Fermat's Last Theorem

More than 50 years ago I made some profound discoveries that I’ve used over the years to explore the world of mathematical physics and the relation between quantum mechanics and consciousness. This adventure began when I developed a proof for the famous mathematical conundrum known as Fermat’s Last Theorem in 1965. 
My proof, known as FLT65, has never been refuted. Fermat’s Last Theorem, thought by most to be an abstract number theory theorem, has serious application to quantum physics and It is being currently being reviewed in connection with new research.

This is the first in a series of posts of sections of this paper currently being reviewed by  number of mathematicians and scientists. 

CLARIFICATION AND EXPLANATION OF FLT65

A 1965 PROOF OF FERMAT’S LAST THEOREM

By Edward R. Close, PhD

ABSTRACT:

Fermat’s last theorem (FLT) states that no three positive integers X₁, Y₁, and Z₁ can satisfy the equation xⁿ +yⁿ = zⁿ for any integer value of n greater than two. Fermat penned the following statement in Latin in the margin of a book on Diophantine equations in 1637:

“Concerning whole numbers, while certain squares can be separated into two squares, it is impossible to separate a cube into two cubes or a fourth power into two fourth powers or, in general any power greater than the second into two powers of like degree. I have discovered a truly marvelous demonstration, which this margin is too narrow to contain.”

-        Pierre de Fermat, circa 1637 ^[1]

Fermat’s “marvelous” proof was never found and the theorem remained officially a conjecture without proof until Andrew Wiles published a lengthy treatment in 1995 that was accepted by number theorists as a valid proof ^[3]. Prior to that, however, Edward R. Close completed a proof in 1965 (FLT65), submitted it to the first of many reviewers in 1966, and published it in 1977 ^[4]. The Close proof though never refuted, presented difficulties for some reviewers because of unconventional notation, and at least three reviewers have suggested that the difference between applying the division algorithm to algebraic polynomial factors and integer factors of the equation as used in the proof make it questionable and either incomplete or incorrect. This concern is addressed in this paper and shown to be unwarranted: There has been a tendency for reviewers to ignore the uniqueness requirements for the division algorithm stated in FLT65 while looking for mistakes which they assume must be there, for reasons explained in this paper. When everything presented in FLT65 is appropriately considered, the concern over the application of the division algorithm is eliminated, removing the only serious objections to the proof.

______________

In this paper, the author provides a brief description and history of FLT65, followed by presentation and refutation of the objections and supposed counterexamples offered by some reviewers in efforts to invalidate FLT65. Several appendices are attached, including a copy of the original FLT65 proof. The other appendices contain supporting arguments and information confirming that FLT65 was and is, a valid proof, justifying the statement found on the last page of FLT65:

“… we have reached a complete contradiction by assuming X, Y and Z to be integers, and may state that the equation X^N + Y^N = Z^N has no solutions in positive integers when N is an integer > 2. And so the proof of Fermat’s last theorem is complete.”

-        Edward R. Close, December 18, 1965 ^[2]