Editing Conjecture (section)

==Important examples==

===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>

===Four color theorem===
{{Main|Four color theorem}}
[[File:Map of United States vivid colors shown.png|thumb|A four-coloring of a map of the states of the United States (ignoring lakes).]]

In [[mathematics]], the [[four color theorem]], or the four color map theorem, states that given any separation of a plane into [[wikt:contiguity|contiguous]] regions, producing a figure called a ''map'', no more than four colors are required to color the regions of the map—so that no two adjacent regions have the same color. Two regions are called ''adjacent'' if they share a common boundary that is not a corner, where corners are the points shared by three or more regions.<ref>{{cite journal |title=Formal Proof—The Four-Color Theorem |author-link=Georges Gonthier|author=Georges Gonthier |journal=Notices of the AMS |volume=55 |issue=11 |date=December 2008 |pages=1382–1393|quote=From this paper: Definitions: A planar map is a set of pairwise disjoint subsets of the plane, called regions. A simple map is one whose regions are connected open sets. Two regions of a map are adjacent if their respective closures have a common point that is not a corner of the map. A point is a corner of a map if and only if it belongs to the closures of at least three regions. Theorem: The regions of any simple planar map can be colored with only four colors, in such a way that any two adjacent regions have different colors.}}</ref> For example, in the map of the United States of America, Utah and Arizona are adjacent, but Utah and New Mexico, which only share a [[Four Corners Monument|point]] that also belongs to Arizona and Colorado, are not.

[[August Ferdinand Möbius|Möbius]] mentioned the problem in his lectures as early as 1840.<ref name="rouse_ball_1960">[[W. W. Rouse Ball]] (1960) ''The Four Color Theorem'', in Mathematical Recreations and Essays, Macmillan, New York, pp 222-232.</ref> The conjecture was first proposed on October 23, 1852<ref name=MacKenzie>Donald MacKenzie, ''Mechanizing Proof: Computing, Risk, and Trust'' (MIT Press, 2004) p103</ref> when [[Francis Guthrie]], while trying to color the map of counties of England, noticed that only four different colors were needed. The [[five color theorem]], which has a short elementary proof, states that five colors suffice to color a map and was proven in the late 19th century;<ref>{{Cite journal|last=Heawood|first=P. J.|date=1890|title=Map-Colour Theorems|journal=Quarterly Journal of Mathematics|location=Oxford|volume=24|pages=332–338}}</ref> however, proving that four colors suffice turned out to be significantly harder. A number of false proofs and false [[counterexample]]s have appeared since the first statement of the four color theorem in 1852.

The four color theorem was ultimately proven in 1976 by [[Kenneth Appel]] and [[Wolfgang Haken]]. It was the first major [[theorem]] to be [[computer-assisted proof#Theorems proved with the help of computer programs|proved using a computer]]. Appel and Haken's approach started by showing that there is a particular set of 1,936 maps, each of which cannot be part of a smallest-sized counterexample to the four color theorem (i.e., if they did appear, one could make a smaller counter-example). Appel and Haken used a special-purpose computer program to confirm that each of these maps had this property. Additionally, any map that could potentially be a counterexample must have a portion that looks like one of these 1,936 maps. Showing this with hundreds of pages of hand analysis, Appel and Haken concluded that no smallest counterexample exists because any must contain, yet do not contain, one of these 1,936 maps. This contradiction means there are no counterexamples at all and that the theorem is therefore true. Initially, their proof was not accepted by mathematicians at all because the [[computer-assisted proof]] was infeasible for a human to check by hand.<ref>{{Cite journal|last=Swart|first=E. R.|date=1980|title=The Philosophical Implications of the Four-Color Problem|journal=The American Mathematical Monthly|volume=87|issue=9|pages=697–702|doi=10.2307/2321855|issn=0002-9890|jstor=2321855}}</ref> However, the proof has since then gained wider acceptance, although doubts still remain.<ref>{{Cite book|title=Four colors suffice : how the map problem was solved|last=Wilson|first=Robin|publisher=Princeton University Press|year=2014|isbn=9780691158228|edition=Revised color|location=Princeton, New Jersey|pages=216–222|oclc=847985591}}</ref>

===Hauptvermutung===
{{main|Hauptvermutung}}

The [[Hauptvermutung]] (German for main conjecture) of [[geometric topology]] is the conjecture that any two [[Triangulation (topology)|triangulations]] of a [[triangulable space]] have a common refinement, a single triangulation that is a subdivision of both of them. It was originally formulated in 1908, by [[Ernst Steinitz|Steinitz]] and [[Heinrich Tietze|Tietze]].<ref>{{Cite web|url=https://www.maths.ed.ac.uk/~v1ranick/haupt/|title=Triangulation and the Hauptvermutung|website=www.maths.ed.ac.uk|access-date=2019-11-12}}</ref>

This conjecture is now known to be false. The non-manifold version was disproved by [[John Milnor]]<ref>{{Cite journal|first=John W.|last= Milnor |title=Two complexes which are homeomorphic but combinatorially distinct|journal= [[Annals of Mathematics]]|volume=74|year=1961|issue= 2 |pages=575&ndash;590|mr=133127|doi=10.2307/1970299|jstor=1970299}}</ref> in 1961 using [[Analytic torsion|Reidemeister torsion]].

The [[manifold]] version is true in [[dimension]]s {{nowrap|1=''m'' ≤ 3}}. The cases {{nowrap|1=''m'' = 2 and 3}} were proved by [[Tibor Radó]] and [[Edwin E. Moise]]<ref>{{cite book | last = Moise | first = Edwin E. | title = Geometric Topology in Dimensions 2 and 3 | publisher = New York : Springer-Verlag | location = New York | year = 1977 | isbn = 978-0-387-90220-3 }}</ref> in the 1920s and 1950s, respectively.

===Weil conjectures===
{{main|Weil conjectures}}
In [[mathematics]], the [[Weil conjectures]] were some highly influential proposals by {{harvs|txt|authorlink=André Weil|first=André |last=Weil|year=1949}} on the [[generating function]]s (known as [[local zeta-function]]s) derived from counting the number of points on [[algebraic variety|algebraic varieties]] over [[finite field]]s.

A variety ''V'' over a finite field with ''q'' elements has a finite number of [[rational point]]s, as well as points over every finite field with ''q''<sup>''k''</sup> elements containing that field. The generating function has coefficients derived from the numbers ''N''<sub>''k''</sub> of points over the (essentially unique) field with ''q''<sup>''k''</sup> elements.

Weil conjectured that such ''zeta-functions'' should be [[rational function]]s, should satisfy a form of [[functional equation]], and should have their zeroes in restricted places. The last two parts were quite consciously modeled on the [[Riemann zeta function]] and [[Riemann hypothesis]]. The rationality was proved by {{harvtxt|Dwork|1960}}, the functional equation by {{harvtxt|Grothendieck|1965}}, and the analogue of the Riemann hypothesis was  proved by {{harvtxt|Deligne|1974}}.

===Poincaré conjecture===
{{main|Poincaré conjecture}} 
In [[mathematics]], the [[Poincaré conjecture]] is a [[theorem]] about the [[Characterization (mathematics)|characterization]] of the [[3-sphere]], which is the hypersphere that bounds the [[unit ball]] in four-dimensional space. The conjecture states that: {{Blockquote|Every [[simply connected]], [[closed manifold|closed]] 3-[[manifold]] is [[homeomorphic]] to the 3-sphere.|sign=|source=}} An equivalent form of the conjecture involves a coarser form of equivalence than homeomorphism called [[homotopy equivalence]]: if a 3-manifold is ''homotopy equivalent'' to the 3-sphere, then it is necessarily ''homeomorphic'' to it.

Originally conjectured by [[Henri Poincaré]] in 1904, the theorem concerns a space that locally looks like ordinary three-dimensional space but is connected, finite in size, and lacks any boundary (a [[Closed manifold|closed]] [[3-manifold]]). The Poincaré conjecture claims that if such a space has the additional property that each [[path (topology)|loop]] in the space can be continuously tightened to a point, then it is necessarily a three-dimensional sphere. An [[generalized Poincaré conjecture|analogous result]] has been known in higher dimensions for some time.

After nearly a century of effort by mathematicians, [[Grigori Perelman]] presented a proof of the conjecture in three papers made available in 2002 and 2003 on [[arXiv]]. The proof followed on from the program of [[Richard S. Hamilton]] to use the [[Ricci flow]] to attempt to solve the problem. Hamilton later introduced a modification of the standard Ricci flow, called ''Ricci flow with surgery'' to systematically excise singular regions as they develop, in a controlled way, but was unable to prove this method "converged" in three dimensions.<ref>{{cite journal | last = Hamilton | first = Richard S. | author-link = Richard S. Hamilton | title = Four-manifolds with positive isotropic curvature | journal = Communications in Analysis and Geometry | volume = 5 | issue = 1 | pages = 1&ndash;92 | year = 1997 | doi =  10.4310/CAG.1997.v5.n1.a1| mr = 1456308 | zbl = 0892.53018| doi-access = free }}</ref>  Perelman completed this portion of the proof. Several teams of mathematicians have verified that Perelman's proof is correct.

The Poincaré conjecture, before being proven, was one of the most important open questions in [[topology]].

===Riemann hypothesis===
{{main|Riemann hypothesis}}
In mathematics, the [[Riemann hypothesis]], proposed by {{harvs|txt|first=Bernhard|last= Riemann|year=1859|author-link=Bernhard Riemann}}, is a conjecture that the non-trivial [[root of a function|zeros]] of the [[Riemann zeta function]] all have [[real part]] 1/2.  The name is also used for some closely related analogues, such as the [[Riemann hypothesis for curves over finite fields]].

The Riemann hypothesis implies results about the distribution of [[prime numbers]]. Along with suitable generalizations, some mathematicians consider it the most important unresolved problem in [[pure mathematics]].<ref>{{Cite web|url=http://www.claymath.org/sites/default/files/official_problem_description.pdf|title=The Riemann Hypothesis – official problem description|last=Bombieri|first=Enrico|date=2000|website=Clay Mathematics Institute|access-date=2019-11-12|archive-date=2015-12-22|archive-url=https://web.archive.org/web/20151222090027/http://www.claymath.org/sites/default/files/official_problem_description.pdf|url-status=dead}}</ref> The Riemann hypothesis, along with the [[Goldbach conjecture]], is part of [[Hilbert's eighth problem]] in [[David Hilbert]]'s list of [[Hilbert's problems|23 unsolved problems]]; it is also one of the [[Clay Mathematics Institute]] [[Millennium Prize Problems]].

===P versus NP problem===
{{main|P versus NP problem}}
The [[P versus NP problem]] is a major [[List of unsolved problems in computer science|unsolved problem in computer science]]. Informally, it asks whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer; it is widely conjectured that the answer is no. It was essentially first mentioned in a 1956 letter written by [[Kurt Gödel]] to [[John von Neumann]].  Gödel asked whether a certain NP-complete problem could be solved in quadratic or linear time.<ref>Juris Hartmanis 1989, [http://ecommons.library.cornell.edu/bitstream/1813/6910/1/89-994.pdf Gödel, von Neumann, and the P = NP problem], Bulletin of the
European Association for Theoretical Computer Science, vol. 38, pp. 101–107</ref> The precise statement of the P=NP problem was introduced in 1971 by [[Stephen Cook]] in his seminal paper "The complexity of theorem proving procedures"<ref>{{Cite book|last=Cook|first=Stephen|author-link=Stephen Cook|year=1971|chapter=The complexity of theorem proving procedures|chapter-url=http://portal.acm.org/citation.cfm?coll=GUIDE&dl=GUIDE&id=805047|title=Proceedings of the Third Annual ACM Symposium on Theory of Computing|pages=151–158|doi=10.1145/800157.805047|isbn=9781450374644|s2cid=7573663}}</ref> and is considered by many to be the most important open problem in the field.<ref>[[Lance Fortnow]], [https://wayback.archive-it.org/all/20110224135332/http://www.cs.uchicago.edu/~fortnow/papers/pnp-cacm.pdf ''The status of the '''P''' versus '''NP''' problem''], Communications of the ACM 52 (2009), no.&nbsp;9, pp.&nbsp;78–86. {{doi|10.1145/1562164.1562186}}</ref> It is one of the seven [[Millennium Prize Problems]] selected by the [[Clay Mathematics Institute]] to carry a US$1,000,000 prize for the first correct solution.

===Other conjectures===
* [[Goldbach's conjecture]]
* The [[twin prime conjecture]]
* The [[Collatz conjecture]]
* The [[Manin conjecture]]
* The [[Maldacena conjecture]]
* The [[Euler's sum of powers conjecture|Euler conjecture]], proposed by Euler in the 18th century but for which counterexamples for a number of exponents (starting with n=4) were found beginning in the mid 20th century
* The [[Second Hardy–Littlewood conjecture|Hardy-Littlewood conjectures]] are a pair of conjectures concerning the distribution of prime numbers, the first of which expands upon the aforementioned twin prime conjecture. Neither one has either been proven or disproven, but it ''has'' been proven that both cannot simultaneously be true (i.e., at least one must be false). It has not been proven which one is false, but it is widely believed that the first conjecture is true and the second one is false.<ref>{{cite journal | first=Ian | last=Richards | title=On the Incompatibility of Two Conjectures Concerning Primes | journal=Bull. Amer. Math. Soc. | volume=80 | pages=419–438 | year=1974 | doi=10.1090/S0002-9904-1974-13434-8 | doi-access=free }}</ref>
* The [[Langlands program]]<ref>{{citation|last=Langlands|first=Robert|title=Letter to Prof. Weil|year=1967|url=http://publications.ias.edu/rpl/section/21}}</ref> is a far-reaching web of these ideas of '[[unifying conjecture]]s' that link different subfields of mathematics (e.g. between [[number theory]] and [[representation theory]] of [[Lie group]]s). Some of these conjectures have since been proved.