Fermat's Last Theorem. In number theory, Fermat's Last Theorem (sometimes called Fermat's conjecture, especially in older texts) states that no three positive integers a, b, and c satisfy the equation an + bn = cn for any integer value of n greater than 2. The cases n = 1 and n = 2 have been known to have infinitely many solutions since antiquity.
just asking if anybody read the book and understood it ? Wiles's proof of Fermat's Last Theorem is a proof, by British mathematician Andrew Wiles, of a special case of the modularity theorem for elliptic curves.
Read it many years ago... What I remember (if my memory serves me well) is that Fermat wrote a small note to imply he found a formal proof that has never been found and only did spread gas to the fire towards trying to actually proving it. As far as Andrew Wiles, what I remember is that he found a computational numeric solution (still hard work) but is it really a proof?
If n = 3, then 4n + 7n = 11n, or 12 + 21 = 33... that was too easy. Did you state the formula correctly?
did you understand the question correctly ?
I'll have to learn this for my college degree.
That’s the fantastic thing about the theorum. It can be stated so briefly, but takes volumes to prove.
Anyone ready to prove the Riemann hypothesis?
Check your font. Exponents are usually shown as "a^n" when using text, or LaTeX for that matter (if I recall correctly).
Otherwise you are stating there are no integers for which 3a+3b=3c, so, I can't choose a=1, b=2 and c=3 and have this work?
NOW, if you mean Fermats last theorem which states a^n+b^n=c^n fails for any integer values of n>2, I see your point and no, I haven't read the recent proof yet, and I mean to. I expect it to be fascinating.
Note: Pardon if my snark is too strong here. I couldn't resist as I am a math person. If YOU are also a math person, you should've caught that, and fixed it, readily.
You got to it before I did. an+bn=cn could be handled quite easily. Now my math interest has been piqued, so I'll be reading about Fermat's Last Theorem for a while.
formulated in 1637, states that no three distinct positive integers a, b, and c can satisfy the equation
a n + b n = c n {\displaystyle a^{n}+b^{n}=c^{n}}
if n is an integer greater than two (n > 2)
Wiles already solved it, just asking if anybody understood it ?
I though I understood the concept, but I cannot say much about it without going through it again.
Are you talking about the proof or is there a book on Wiles life? If I'm not mistaken it was kind of a riddle that was around for hundreds of years. I definitely couldn't have solved it.
Found It REALLY hard going! The theory,if I remember correctly dates back too the early 1600's ? Which led too algabretic number theory,in the 1800's.Wiles's proved the theory in the mid 1900's.I found the concept is hard too comprehend, & would never try too claim I understand it fully!
@LimitedLight checked it up,1994 the theory was proven.Algabtetic theory 1877.The original theory goes back too the 1600's,couldn't find an accurate date.
LOL! Not exactly the subject most women want to discuss with strangers.
If you write your profile and answer the profile questions, people can get to know you and you will gain points. Then start making comments and posting your own questions to gain more points. When you reach level two, you can send private messages to people.