Difference between revisions of "Elementary proof"
m (Elementary techniques moved to Elementary proof) |
|||
| Line 1: | Line 1: | ||
| − | The term "elementary techniques" in mathematics means use of | + | The term "elementary proof" or "elementary techniques" in mathematics means use of only [[real numbers]] rather than [[complex numbers]], which relies on manipulation of the imaginary square root of (-1). Elementary proofs are preferred because they are do not require additional assumptions inherent in complex analysis, such as that there is a unique square root of (-1) that will yield consistent results. |
| − | + | Mathematicians also consider elementary techniques to include objects, operations, and relations. Sets, sequences and geometry are not included. | |
| + | |||
| + | The prime number theorem has long been proven using non-elementary techniques, 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 22:48, December 23, 2006
The term "elementary proof" or "elementary techniques" in mathematics means use of only real numbers rather than complex numbers, which relies on manipulation of the imaginary square root of (-1). Elementary proofs are preferred because they are do not require additional assumptions inherent in complex analysis, such as that there is a unique square root of (-1) that will yield consistent results.
Mathematicians also consider elementary techniques to include objects, operations, and relations. Sets, sequences and geometry are not included.
The prime number theorem has long been proven using non-elementary techniques, but in 1949 and 1950 an elementary proof by Paul Erdos and Atle Selberg earned Selberg the highest prize in math, the Fields medal.
