Changes

Jump to navigation Jump to search
69 bytes added ,  02:33, August 25, 2009
or use of the Axiom of Choice
Line 1: Line 1: −
An '''elementary proof''' or '''elementary technique''' in mathematics is a [[proof]] that uses only [[real numbers]] or [[real analysis]] rather than the use of [[complex analysis]].<ref>http://mathworld.wolfram.com/ElementaryProof.html</ref>  An elementary proof typically cannot be improved by expressing it in simpler form.
+
An '''elementary proof''' or '''elementary technique''' in mathematics is a [[proof]] that uses only [[real numbers]] or [[real analysis]] rather than the use of [[complex analysis]]<ref>http://mathworld.wolfram.com/ElementaryProof.html</ref> or reliance on less rigorous axioms, such as the [[Axiom of Choice]]. An elementary proof typically cannot be improved by expressing it in simpler form.
    
The [[Prime Number Theorem]] has long been proven using complex analysis ([[Riemann Zeta function]]), but in 1949 and 1950 an elementary proof by [[Paul Erdos]] and [[Atle Selberg]] earned Selberg the highest prize in math, the [[Fields Medal]]. In contrast, [[Andrew Wiles]]' proof of [[Fermat's Last Theorem]] did not use elementary techniques.<ref name="Occam">http://www.occampress.com/fermat.pdf Page 5</ref>
 
The [[Prime Number Theorem]] has long been proven using complex analysis ([[Riemann Zeta function]]), but in 1949 and 1950 an elementary proof by [[Paul Erdos]] and [[Atle Selberg]] earned Selberg the highest prize in math, the [[Fields Medal]]. In contrast, [[Andrew Wiles]]' proof of [[Fermat's Last Theorem]] did not use elementary techniques.<ref name="Occam">http://www.occampress.com/fermat.pdf Page 5</ref>
Anthony, Irenaeus, Siteadmin, apieditor, Bureaucrats, Check users, nsAm_Govt_101RO, nsAm_Govt_101RW, nsAm_Govt_101_ta, nsJudgesRO, nsJudgesRW, nsJudges_talkRO, nsJudges_talkRW, nsTeam2RO, nsTeam2RW, nsTeam2_talkRO, nsTeam2_talkRW, oversight, Administrators
126,194

edits

Navigation menu