Difference between revisions of "Elementary proof"
From Conservapedia
(links, capitalization) |
Vyngarsson (Talk | contribs) |
||
| 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> Elementary proofs cannot be broken down into smaller proofs of the same proposition. |
Revision as of 21:33, April 13, 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] Elementary proofs cannot be broken down into smaller proofs of the same proposition.
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:
