Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Conjecture
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Fermat's Last Theorem=== {{main|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 number|positive]] [[integer]]s <math>a</math>, ''<math>b</math>'', and ''<math>c</math>'' can satisfy the equation ''<math>a^n + b^n = c^n</math>'' for any integer value of ''<math>n</math>'' greater than two. This theorem was first conjectured by [[Pierre de Fermat]] in 1637 in the margin of a copy of ''[[Arithmetica]]'', where he claimed that he had a proof that was too large to fit in the margin.<ref>{{citation|first=Oystein|last=Ore|title=Number Theory and Its History|year=1988|orig-year=1948|publisher=Dover|isbn=978-0-486-65620-5|pages=[https://archive.org/details/numbertheoryitsh0000orey/page/203 203β204]|url=https://archive.org/details/numbertheoryitsh0000orey/page/203}}</ref> [[Wiles' proof of Fermat's Last Theorem|The first successful proof]] was released in 1994 by [[Andrew Wiles]], and formally published in 1995, after 358 years of effort by mathematicians. The unsolved problem stimulated the development of [[algebraic number theory]] in the 19th century, and the proof of the [[modularity theorem]] in the 20th century. It is among the most notable theorems in the [[history of mathematics]], and prior to its proof it was in the ''[[Guinness Book of World Records]]'' for "most difficult mathematical problems".<ref>{{Cite book|title=The Guinness Book of World Records|publisher=Guinness Publishing Ltd.|year=1995|chapter=Science and Technology}}</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)