Jump to content

A Challenging Math Question


Raylen

Recommended Posts

For those who think they know the answer, I know that you don't know the answer.

 

To those who know what the question really is, please don't say anything.

 

Prove that there is no integer solution set of (a,b,c) to the following.

 

a^n + b^n = c^n

 

for any value of n such that n > 2.

 

So... prove away.

 

[spoiler=Problem Source:] Pierre de Fermat, 1621.

 

[spoiler=Answer:] There is no answer. It remains unproven to this day.

 

Link to comment
Share on other sites

Bah' date=' I was just about to prove you wrong until you said n > 2.

 

And I'm assuming the value for the variables must be different.

 

Ugh...

 

It doesn't seem impossible... but it probably is. :/

[/quote']

 

Dark dont feel bad

It is possible to prove but it took about 400 years

And the proof my good men for those of you that want to read it

http://www.fermatproof.com/

Link to comment
Share on other sites

This is just Fermat's Last Theorem. It was proven in 1995, if memory serves me correctly.

 

It was proved. 400 years ago' date=' in fact. Simply the prover, didn't write it down. He wrote the thing, but then wrote that the proof wouldn't fit in the margin he was writing in. And so, a 400 year search commenced for the proof this man had found.

[/quote']

 

No, Fermat simply claimed to have found a proof of it. First of all, he was in the habit of claiming to have proven things that were really just unproved conjectures, and second of all, the actual proof that was eventually found requires branches of mathematics that didn't even exist when Fermat was alive.

Link to comment
Share on other sites

This is just Fermat's Last Theorem. It was proven in 1995' date=' if memory serves me correctly.

 

It was proved. 400 years ago, in fact. Simply the prover, didn't write it down. He wrote the thing, but then wrote that the proof wouldn't fit in the margin he was writing in. And so, a 400 year search commenced for the proof this man had found.

 

No, Fermat simply claimed to have found a proof of it. First of all, he was in the habit of claiming to have proven things that were really just unproved conjectures, and second of all, the actual proof that was eventually found requires branches of mathematics that didn't even exist when Fermat was alive.

 

Correct by Andrew Wiles

Now if someone can find a simpler proof then he did that is the trick

Link to comment
Share on other sites

1^3 + 4^3 does not equal 5^3

 

1+64=65 not 125

 

EDIT: there are no set values for ABC

 

so

a=1

b=4

c=5

 

DOUBLE EDIT: I don't care whose proof it is. that works and its just that simple. and my mistake 4^2 was stuck in my brain.Regardless it doesn't work

Link to comment
Share on other sites

Archived

This topic is now archived and is closed to further replies.

×
×
  • Create New...