Оценить:
 Рейтинг: 0

The Wonders of Arithmetic from Pierre Simon de Fermat

Год написания книги
2021
<< 1 ... 19 20 21 22 23 24 25 26 27 ... 30 >>
На страницу:
23 из 30
Настройки чтения
Размер шрифта
Высота строк
Поля

=p

(q

+r)=(pq)

+p

r and here in all variants of numbers q and r it turns out that p

r also is not a square then the number c

also cannot be the sum of two squares.] But this is a vicious circle because again you need to decompose square into a sum of two squares. However, the situation is already completely different because now you need to decompose a square of prime number and this circumstance becomes the basis for solving the task. If a solution is possible, then there must exist such prime numbers that decomposes into the sum of two squares and only in this case in accordance with the identity of the Pythagoreans, you can obtain:

p

=(x

+y

)

=(x

?y

)

+(2xy)

i.e. the square of such a prime will also be the sum of two squares. From here appears the truly grandiose scientific discovery of Fermat:[53 - This discovery was first stated in Fermat’s letter to Mersenne dated December 25, 1640. Here, in item 2-30 it is reported: “This number (a prime of type 4n+1) being the hypotenuse of one right triangle, its square will be the hypotenuse of two, cube – of three, biquadrate – of four etc. to infinity". This is an inattention that is amazing and completely unusual for Fermat, because the correct statement is given in the neighbor item 2-20. The same is repeated in Fermat’s remark on Bachet’s commentary to task 22 book III of Arithmetic by Diophantus. But here immediately after this obviously erroneous statement the correct one follows: “This a prime number and its square can be divided into two squares in only one way; its cube and biquadrate only two; its quadrate-cube and cube-cube only three, etc. to infinity" (see Pt. 3.6). In this letter Fermat apparently felt that something was wrong here, therefore he added the following phrase: “I am writing to you in such a hurry that I do not pay attention to the fact that there are errors and omit a lot of things, about which I tell you in detail another time”. This of course, is not that mistake, which could have serious consequences, but the fact is that this blunder has been published in the print media and Internet for the fourth century in a row! It turns out that the countless publications of Fermat's works no one had ever carefully read, otherwise one else his task would have appeared, which obviously would have no solution.]

All primes of type 4n+1 can be uniquely decomposed into the sum of two squares, i.e. the equation p=4n+1=x

+y

has a unique solution in integers. But all other primes of type 4n?1 cannot be decomposed in the same way.

In the Fermat's letter-testament it was shows how this can be proven by the descent method. However, Fermat’s proof was not preserved and Euler who solved this problem had to use for this all his intellectual power for whole seven years.[54 - Euler's proof is not constructive i.e. it does not provide a method for calculating the two squares that make up a prime of type 4n+1 (see Appendix III). So far, this problem has only a Gauss' solution, but it was obtained in the framework of a very complicated system “Arithmetic of Deductions”. The solution Fermat reported is still unknown. However, see comment 172 in Appendix IV (Year 1680).] Now already the solution to the Diophantine task seems obvious. If among the prime factors of number c there is not one related to the type 4n+1, then the number c

cannot be decomposed into the sum of two squares. And if there is at least one such number p

, then through the Pythagoreans’ identity it can be obtain:

c

= N

p

= (Nx)

+(Ny)

where x= u

?v

; y=2uv; a=N(u

?v

); b=N2uv

The solution is obtained, however it clearly does not satisfy Fermat because in order to calculate the number N you need to decompose the number c into prime factors, but this task at all times was considered as one of the most difficult of all problems in arithmetic.[55 - Methods of calculating prime numbers have been the subject of searches since ancient times. The most famous method was called the "Eratosthenes’ Sieve". Many other methods have also been developed, but they are not widely used. A fragment of Fermat’s letter with a description of the method he created, has been preserved the letter LVII 1643 [36]. In item 7 of the letter-testament he notes: “I confess that my invention to establish whether a given number is prime or not, is imperfect. But I have many ways and methods in order to reduce the number of divides and significantly reduce them facilitating usual work." See also Pt. 5.1 with comments 73-74.] Then you need to calculate the numbers x, y i.e. solve the problem of decomposing a prime of type 4n+1 into the sum of two squares. To solve this problem, Fermat worked almost until the end of his life.

It is quite natural that when there is a desire to simplify the solution of the Diophantine task, a new idea also arises of obtaining a general solution of the Pythagoras’ equation a

+ b

= c

in a way different from using the identity of Pythagoreans. As it often happens, a new idea suddenly arises after experienced strong shocks. Apparently, this happened during the plague epidemic of 1652 when Fermat managed to survive only by some miracle, but it was after that when he quite clearly imagined how to solve the Pythagoras’ equation in a new way.

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

+b

=c

can be solved in the same way also a

+b

=c

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.

4.2. Fermat’s Proof

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
<< 1 ... 19 20 21 22 23 24 25 26 27 ... 30 >>
На страницу:
23 из 30