Difference between revisions of "Elementary proof"
Jump to navigation
Jump to search
Sciencebuff (talk | contribs) (linking to proof) |
(links, capitalization) |
||
| Line 1: | Line 1: | ||
| − | The term "elementary proof" or "elementary techniques" in mathematics means [[proof | proofs]] that use only [[real numbers]] or real analysis rather than the use of complex analysis.<ref>http://mathworld.wolfram.com/ElementaryProof.html</ref> | + | The term "elementary proof" or "elementary techniques" in mathematics means [[proof | proofs]] that use only [[real numbers]] or [[real analysis]] rather than the use of [[complex analysis]].<ref>http://mathworld.wolfram.com/ElementaryProof.html</ref> |
| − | The prime number theorem has long been proven using complex analysis (Riemann's 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 | + | The prime number theorem has long been proven using complex analysis (Riemann's 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]]. |
---- | ---- | ||
Revision as of 15:59, April 1, 2007
The term "elementary proof" or "elementary techniques" in mathematics means proofs that use only real numbers or real analysis rather than the use of complex analysis.[1]
The prime number theorem has long been proven using complex analysis (Riemann's 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.
Sources: