Elementary proof

From Conservapedia
This is an old revision of this page, as edited by Aschlafly (Talk | contribs) at 16:07, 23 December 2006. It may differ significantly from current revision.

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

The term "elementary techniques" in mathematics means use of traditional, very well-understood fields of mathematics like number theory. Other fields of math that require additional assumptions, such as complex analysis, cannot be used in a proof based on elementary techniques. Included in elementary techniques are objects, operations, and relations. Sets, sequences and many types of geometry are not included.

For example, there was a proof of the prime number theorem relying on non-elementary techniques, but in 1949 and 1950 an "elementary proof" by Erdos and Selberg earned Selberg the highest prize in math, the Fields medal.