Downloads       Questions and Answers       Miscellaneous        Contest materials           

 

 

 

 

ATTENTION! The number of accepted proposals is already large.

New participants will have very slim chances to win the award.

 

MATHEMATICAL CONTEST WITH A CASH AWARD

"Finding a fundamental flaw in the proof of Fermat Last Theorem"

Contest goal: Finding a fundamental error in the proposed proof of Fermat Last Theorem<1>. Winners receive cash awards.

Contest organizer: Dr. Sci, former Professor, Y. K. Shestopaloff.

Reviewers of proposals: Yuri K. Shestopaloff, Alexander Y. Shestopaloff (PhD, Research Fellow at Turing Institute of AI, London, UK).

Rights: Authorship of the proposed proof belongs to Y. K. Shestopaloff<2>, which is confirmed by published material in the form of articles, preprints and books<3>.  

Participants: No restrictions. Participants submit materials with description of errors they found in the proof.

Prerequisites: High School advanced math courses, or the first year University math courses.

Working languages: English or Russian. The proof is available both in English and Russian.

Privacy and security: On acceptance of their materials, participants receive identification number (ID). The organizer displays online only participant's ID.  Organizers do not share the contact information.

Deadline: Contest materials should be submitted before Greenwich noon time, May 31, 2019.

Review time: Tentatively Greenwich noon time, June 20, 2019. If there are too many submissions, review time can be extended.

Extension: The contest can be extended if there is no winner in the previous stage.

 

AWARDS

In 3 days after the completion of reviews, the contest results are published on the author's website www.shestopalofff.ca.

The reward for finding a fundamental error (see explanation in the "Contest Rules" section) is CAD 7000 (Seven thousand Canadian dollars).

The reward for finding a non-fundamental error is CAD 1000 (One thousand Canadian dollars), provided no participant found a fundamental error.

Attention!

A winner can be only a registered participant.

In case if several participants find errors, the award is equally shared between the first three.

An award is issued by a cheque written by a Canadian bank in Canadian dollars in the name of a participant indicated in the originally submitted material.

It is responsibility of a participant to cash the issued cheque.

 

CONTEST RULES

1. Those willing to participate in the contest send their material via email shes(then add a number, the square of 13)@yahoo.ca. The articles with a proof can be downloaded from the Internet (see the link "Downloads" at the top of the page). In all communications, the subject line should start with 'FLT article'. Contest starts from March 1, 2019.

2. Proposals should be submitted as PDF files, in English or in Russian.

3. By submitting their material, participants agree for its use in other publications, accompanied by the appropriate reference to participants' authorship. A participant can ask to place his / her materials on the author's website under his / her ID after the publication of contest results.

4. A fundamental error is such a flaw that makes the proposed conceptual approach fundamentally impossible to use for such a proof.

5. Non-Fundamental error is such a flaw, whose correction does not change the concept of the proof and does not challenge its concept.

6. If a participant substantiates the validity of the proof, with his / her request and explicit permission, the participant's ID can be published on the website with such an information.

7. Additional information will appear on the author's website www.shestopaloff.ca (see links at the top of the page). Contest info is open for free distribution, copying and publishing in other outlets, with indication of the original source, website www.shestopaloff.ca

 

REFERENCES

<1> Background info. Fermat Last Theorem was formulated in 1637. (It states that the equation x^n + y^n=z^n has no integer solutions for n>2.) The proof was obtained by A. Wiles in 1995. However, it is so complicated and specialized, that only few people can understand it, who assured the humankind that the proof is correct. This is one of the reasons why the search for a simpler proof continues. Yuri K. Shestopaloff proposed a new conceptual approach and presented such a simpler proof. Knowledge of the first year math courses is sufficient for understanding the proof, maybe even High School advanced math courses. Given the challenging reputation of the problem, the skepticism regarding new proofs is justified. The goal of the contest is to find a fundamental error in the proposed proof (if any).

<2> Yuri K. Shestopaloff received his M.Sc, Ph.D and Doctor of Sciences degrees from Moscow Institute of Physics and Technology, focusing on developing mathematical methods and algorithms for processing and interpretation of remote sensing data. He has worked as a Professor and a Chair at Electrical Engineering Department of Omsk State University of Transport Engineers. Simultaneously, he held positions of the Head of Research Lab and Chief Scientist at Institute of Sensor Microelectronics of Russian Academy of Sciences. Yuri does consulting and research on mathematical methods and computational algorithms in various fields of science and technology. He published seventeen professional books and over hundred academic articles. The results of his researches on financial mathematics received awards, including Dietz Award (2015), from "The Journal of Performance Measurement", which is the main award in financial industry in this area of applied mathematics.

<3> Published books containing the presented proof by Yuri K. Shestopaloff, which confirm his authorship: 1. Shestopaloff Yu. K. (2018) Elementary functions and equations. Modeling natural phenomena, 2d Revised edition, AKVY Press, Toronto; 2. Shestopaloff Yu. K. (2019) Elementary Functions and Equations. Fermat Last Theorem and Transformation of Geometrical Forms. 3d Revised edition, AKVY Press, Toronto.)

 Selected publications by Yu. K. Shestopaloff