Obviously, Fermat's Last Theorem
is equivalent to the assertion that such a computer program can never halt.
In 1993, Andrew Wiles of Princeton University announced another proof of Fermat's Last Theorem
, and for a while it held the ring of truth.
Included are questions that were only recently solved, such as Fermat's Last Theorem
and the computer proof of the Four-Color Theorem, as well as unsolved problems such as the Riemann Hypothesis.
Though I was grateful to the folks at MIT, Michigan State, and Stanford for doing all the statistical legwork, they didn't exactly solve Fermat's Last Theorem
or uncrypt the Holy Grail.
Mathematicians performed prodigies of mental gymnastics in quest of the proof, until at Cambridge University in 1993, Professor Andrew Wiles, an English academic at Princeton, ended a brilliant course of lectures at the Newton Institute for Mathematical Sciences with his proof of Fermat's Last Theorem
and said, `I think I'll stop here.' The distinguished audience, which had been expecting something of the sort, burst into applause and the press announced the discovery to the world.
If Stephen Sondheim can write a musical about Georges Seurat's pointillism, why shouldn't Joshua Rosenblum and Joanne Sydney Lessner write one about Pierre de Fermat's last theorem
? Well, because they're not Sondheim.
For example, the recent proof of Fermat's Last Theorem
is a striking case of a powerfully enlightening proof and a wholly unenlightening theorem.
This has become known as Fermat's last theorem
and although it seems simple enough, the proof long evaded the greatest mathematical minds.
Denyer asks why I do not infer that 1 = 0 from the fact that m + 1 = m (= m + 0), by subtracting m from both sides; or claim that Fermat's Last Theorem
is false since [m.sup.m] + [m.sup.m] = [m.sup.m].
Fermat's Last Theorem
is the most famous unsolved problem in mathematics.
The most famour unsolved problem in all of mathematics is Fermat's Last Theorem
which states that the equation [A.sup.n] + [B.sup.n] = [C.sup.n] has no solution in positive integers A, B, C for n > 2.
Saito begins with a rough outline of his proof of what has become known as Fermat's Last Theorem
, then works through it in detail.