Welcome to DU! The truly grassroots left-of-center political community where regular people, not algorithms, drive the discussions and set the standards. Join the community: Create a free account Support DU (and get rid of ads!): Become a Star Member Latest Breaking News General Discussion The DU Lounge All Forums Issue Forums Culture Forums Alliance Forums Region Forums Support Forums Help & Search

malaise

(268,969 posts)
Sun May 5, 2013, 09:35 AM May 2013

For the DU Mathematicians - Elegant New Approach To 350-Year-Old Math Riddle

http://www.redorbit.com/news/science/1112796238/fermats-last-theorem-gets-simplified-030413/
<snip>
In 1637, the French lawyer and part-time mathematician Pierre de Fermat put forward a simple and elegant numerical riddle that would puzzle and confound math geeks for 358 years. Known as Fermat’s Last Theorem, or simply Fermat’s conjecture, the theorem states no whole, positive numbers can make the equation xn + yn = zn true when ‘n’ is greater than 2.

Using a roundabout, backdoor approach that involved dizzyingly complex number theory, the Oxford mathematician Andrew Wiles demonstrated conclusively in 1995 that Monsieur de Fermat was, in fact, correct: The equation is unsolvable.

Now, however, Colin McLarty, a professor of philosophy and mathematics at Case Western Reserve University claims there’s a far simpler way to prove Fermat’s theorem – one that doesn’t involve complex mathematical wizardry with names like “modularity theory” and “epsilon conjectures.”

McLarty demonstrated even the most complex and abstract of Grothendieck’s ideas can be justified using very little set theory. What is known as ‘standard set theory’ is simply the collection of the most commonly used principals, or axioms, used by practicing mathematicians. Grothendieck’s work included the notion of the existence of a universe of number sets so large standard set theory could not even prove they exist.

In McLarty’s vastly simplified approach to Fermat’s problem, he says all mathematicians need is basic ‘finite order arithmetic,’ which uses even fewer sets of numbers than standard set theory.
16 replies = new reply since forum marked as read
Highlight: NoneDon't highlight anything 5 newestHighlight 5 most recent replies
For the DU Mathematicians - Elegant New Approach To 350-Year-Old Math Riddle (Original Post) malaise May 2013 OP
Well, between McLarty and Friedman ... ananda May 2013 #1
In Fermat's version n is a power, not a multiplier Progressive dog May 2013 #2
exactly - thank you - any first year algebra student can solve what is written DrDan May 2013 #3
... Princess Turandot May 2013 #4
Thanks it was bugging me. nt Progressive dog May 2013 #5
x[sup]n[/sup] + y[sup]n[/sup] = z[sup]n[/sup] eppur_se_muova May 2013 #7
Number theory, where the real nerds romp and play. bemildred May 2013 #6
Hmmm...McLarty claims there's a far simpler way to prove Fermat's Theorem... SwissTony May 2013 #8
Oddly familiar that he wouldn't publish an actual proof with the claim bhikkhu May 2013 #15
This is not a new idea adieu May 2013 #9
My guess remains that the "proof" Fermat conjectured jimlup May 2013 #10
This is true edhopper May 2013 #11
Yeah, this is one of the most intriguing stories on the rich tradition of number theory jimlup May 2013 #13
The marginal notation edhopper May 2013 #14
I think there is some brain power over at rurallib May 2013 #12
Best laugh of the day malaise May 2013 #16

ananda

(28,858 posts)
1. Well, between McLarty and Friedman ...
Sun May 5, 2013, 09:50 AM
May 2013

... there ought to be a next step coming around before too long.

Progressive dog

(6,900 posts)
2. In Fermat's version n is a power, not a multiplier
Sun May 5, 2013, 10:09 AM
May 2013

That's in the original article too, but it's wrong. The equation that is written is easily solved.
If you can, could you correct this? Thanks

bemildred

(90,061 posts)
6. Number theory, where the real nerds romp and play.
Sun May 5, 2013, 10:49 AM
May 2013

I think Mr. Friedman is right, they will get a purely numerical proof eventually, Fermat claimed he had one way back then.

Thanks for posting.

SwissTony

(2,560 posts)
8. Hmmm...McLarty claims there's a far simpler way to prove Fermat's Theorem...
Sun May 5, 2013, 11:51 AM
May 2013

but doesn't present it. Does that mean

a) he has a proof but doesn't want to present it just yet
b) a simpler proof is possible in McLarty's opinion but he may or may not have found it

"McLarty says he has demonstrated the correctness of Fermat’s Last Theorem without a mathematical proof and with far less abstract and circuitous theory than that used by Wiles nearly two decades earlier" seems to imply he has found the proof.

"Friedman...called McLarty’s work a 'clarifying first step'” suggests he's possibly on the way but not there yet.

I'm not familiar with redOrbit, so it may be slightly misquoting McLarty or just exaggerating.

And, of course, we've had many "proofs" of FLT before. Only that of Wiles is still around.

bhikkhu

(10,715 posts)
15. Oddly familiar that he wouldn't publish an actual proof with the claim
Sun May 5, 2013, 12:38 PM
May 2013

something like "I have assuredly found an admirable proof of this, but the margin is too narrow to contain it." :p

 

adieu

(1,009 posts)
9. This is not a new idea
Sun May 5, 2013, 12:14 PM
May 2013

The traditional approach that most mathematicians had tried to prove FLT had been to look at the equation purely as a number theory question. You don't think it failed the best minds of the past 350 years because they decided to create the whole world of elliptic curves and algebraic geometry to try to solve it. Most people, professional and amateur mathematicians, tried solving it the "number theory" way.

In a way, they had succeeded for various numbers of "n". First proof fo n = 3 was done, not too difficult. Then 4, then 5, then, some advances as it was proven for all n < (some big number). Then that (some big number) grew even bigger. But, mathematically, it doesn't matter if it's just true for all n less than some huge honkin' number. The theorem has to be for all n > 2.

The problem was that the proof for n = (some number) doesn't extend well to other n's. It's like each n had to have it's own proof. Well, that can get tiresome.

So, I doubt McLarty has any more insight to the problem than the past 350 years' worth of top mathematicians.

jimlup

(7,968 posts)
10. My guess remains that the "proof" Fermat conjectured
Sun May 5, 2013, 12:16 PM
May 2013

was probably incorrect or incomplete. It seems to me unlikely that a "simple" proof would not have been found given the application of significant brain power against it. The number of people with means who have thought seriously about the problem is at least an order of magnitude larger than the number who might have done so in Fermat's time.

edhopper

(33,575 posts)
11. This is true
Sun May 5, 2013, 12:22 PM
May 2013

but it would still be very interesting to know what Fermat's was. And the fact that he was correct probably means it is intriguing at the least.

rurallib

(62,411 posts)
12. I think there is some brain power over at
Sun May 5, 2013, 12:22 PM
May 2013

Free Republic that could dig into this.

.

.
.
(sarcasm for the humor impaired)

Latest Discussions»General Discussion»For the DU Mathematicians...