- 70

- 0

Eight months have passed since the first time when an elementary proof of FLT was found, laid down and proposed to the attention of 70 mathematicians (they have asked for it; most of them are specialized in numbers theory). About 1,000 individuals visited internet sites with the text of the proof. However, no positive nor negative opinions have been expressed so far.

The idea of the elementary proof of the Fermat’s Last Theorem (FLT) proposed to the reader, is extremely simple:

After splitting the numbers a, b, c into pairs of sums, then grouping them in two sums U' and U'' and multiplying the equation a^n + b^n – c^n = 0 by 11^n (i.e. 11 power n, and the numbers a, b, c by 11), the (k+3)-th digit from the right in the number a^n + b^n – c^n (where k is the number of zeroes at the end of the number a + b – c) is not equal to 0 (the numbers U' and U'' are “multiplied” in a different way!). In order to understand the proof, you only need to know the Newton Binomial, the simplest formulation of the Fermat’s Little Theorem (included here), the definition of the prime number, how to add numbers and multiplication of a two-digit number by 11. That’s ALL! The main (and the toughest) task is not to mess up with a dozen of numbers symbolized by letters.

The redaction of the text dates of June 1, 2005 (after a discussion on the Faculty of Mathematics of Moscow University site).

The texts of the proof can be found on following sites:

English version of the demonstration (4kb):

Russin version in pdf : http://fox.ivlim.ru/docs/sorokine/vtf.pdf

FORUMS (Russian-language):

http://lib.mexmat.ru/forum/viewforum.php?f=1&sid=3fefd56c6fe2fa0e361464672ea92292 ;

http://forum.dubinushka.ru/index.php?showforum=40 [Broken] ; http://www.scientific.ru/dforum/altern - page 7.

The idea of the elementary proof of the Fermat’s Last Theorem (FLT) proposed to the reader, is extremely simple:

After splitting the numbers a, b, c into pairs of sums, then grouping them in two sums U' and U'' and multiplying the equation a^n + b^n – c^n = 0 by 11^n (i.e. 11 power n, and the numbers a, b, c by 11), the (k+3)-th digit from the right in the number a^n + b^n – c^n (where k is the number of zeroes at the end of the number a + b – c) is not equal to 0 (the numbers U' and U'' are “multiplied” in a different way!). In order to understand the proof, you only need to know the Newton Binomial, the simplest formulation of the Fermat’s Little Theorem (included here), the definition of the prime number, how to add numbers and multiplication of a two-digit number by 11. That’s ALL! The main (and the toughest) task is not to mess up with a dozen of numbers symbolized by letters.

The redaction of the text dates of June 1, 2005 (after a discussion on the Faculty of Mathematics of Moscow University site).

The texts of the proof can be found on following sites:

English version of the demonstration (4kb):

**Revista Foaie Matematică:**www.fmatem.moldnet.md/1_(v_sor_05).htmRussin version in pdf : http://fox.ivlim.ru/docs/sorokine/vtf.pdf

FORUMS (Russian-language):

http://lib.mexmat.ru/forum/viewforum.php?f=1&sid=3fefd56c6fe2fa0e361464672ea92292 ;

http://forum.dubinushka.ru/index.php?showforum=40 [Broken] ; http://www.scientific.ru/dforum/altern - page 7.

Last edited by a moderator: