Difference between revisions of "Elementary proof"
From Conservapedia
Sciencebuff (Talk | contribs) (linking to proof) |
|||
| Line 1: | Line 1: | ||
| − | The term "elementary proof" or "elementary techniques" in mathematics means use | + | 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> |
Revision as of 22:18, March 16, 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: