However, the method of the key formula for Fermat was not new, but when he deduced this formula and immediately received a new solution to the Pythagoras equation, he was so struck by this that he could not for a long time come to oneself. Indeed, before that to obtain one solution, two integers must be given in the Pythagoreans' identity, but with the new method, it may be obtained minimum three solutions with by only one given integer.

But the most surprising here is that the application of this new method does not depend on the power index and it can be used to solve equations with higher powers i.e. along with the equation a^>2+b^>2=c^>2 can be solved in the same way also a^>n+b^>n=c^>n with any powers n>2. To get the final result, it remained to overcome only some of the technical difficulties that Fermat successfully dealt with. And here such a way it appeared and became famous his remark to the task 8 of Book II Diophantus' "Arithmetic":

Cubum autem in duos cubos, aut quadrato-quadratum in duos quadrato-quadratos, et generaliter nullam in infinitum ultra quadratum potestatem in duas eiusdem nominis fas est dividere cuius rei demonstrationem mirabilem sane detexi. Hanc marginis exiguitas non caperet.

See Pic. 3 and the translation at the end of Pt. 1.

The reconstructed FLT proof presented here contains new discoveries unknown to today’s science. However, from this it does not follows that proof becomes difficult to understand. On the contrary, it is precisely these discoveries that make it possible to solve this problem most simply and easily. The phenomenon of the unprovable FLT itself would not have appeared at all if the French Academy of Sciences had been founded during the lifetime of P. Fermat. Then he would become an academician and published his scientific researches and among his theorems in all arithmetic textbooks there would be also such a most ordinary theorem:

For any given natural number n>2, there is not a single triplet of natural numbers a, b and c, satisfying the equation

a^>n+b^>n=c^>n (1)

To prove this statement, suppose that a, b, c satisfying to (1) exist and then based on this, we can get the all without exception solutions to this equation in general form. To this aim we use the key formula method, in which one more equation is added to the initial equation so that it becomes possible to obtain solution (1) in a system of two equations. In our case the key formula is:

a+b=c+2m (2)

where m is a natural number.

To obtain formula (2) we note that a≠b since otherwise 2a^>n=c^>n what is obviously impossible. Consequently, a>n-1+b^>n-1)>c^>n-1 whence (a+b)>c. Since in (1) cases with three odd a, b, c, as well as one odd and two even are impossible, the numbers a, b, c can be either all even or two odd and one even. Then from (a + b) > c follows formula (2) where the number 2m is even56.

At first, we verify the effectiveness of the method for the case n = 2 or the Pythagoras’ equation a^>2+b^>2=c^>2. Here the key formula (2) applies and you can get a solution to the system of equations (1), (2) if you substitute one into another. To simplify it, we will square both sides of (2) to make the numbers in (1) and (2) proportionate. Then (2) takes the form:

{a^>2+b^>2−c^>2}+2(c−b)(c−a)=4m^>2 (3)

Substituting the Pythagoras’ equation in (3), we obtain:

A_>iB_>i=2m^>2 (4)

where taking into account the formula (2):

A_>i=c−b=a−2m; B_>i=c−a=b−2m (5)

Now we decompose the number 2m^>2 into prime factors to get all the A_>iB_>i options. For primes m there are always only three options: 1×2m