Difference between revisions of "Elementary proof"
Jump to navigation
Jump to search
(added citation) |
(incorrect, this is more accurate) |
||
| Line 1: | Line 1: | ||
| − | The term "elementary proof" or "elementary techniques" in mathematics means use of only [[real numbers]] rather than | + | The term "elementary proof" or "elementary techniques" in mathematics means use of only [[real numbers]] or simple 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 medal. | 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 19:58, March 1, 2007
The term "elementary proof" or "elementary techniques" in mathematics means use of only real numbers or simple 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: