Uncountable

From Conservapedia
This is an old revision of this page, as edited by JustinD (Talk | contribs) at 17:09, 3 July 2013. It may differ significantly from current revision.

Jump to: navigation, search

A set is uncountable if it contains too many elements to be counted. "Too many" in this sense means that there are an infinite number of items in the set and that the items in the set cannot be matched up one for one with the natural numbers (i.e. 1, 2, 3, . . . ). For example, the set {2, 4, 8, 16, 32, . . .} is countable because we can match up the natural numbers to this set by noting that the elements in the latter set are equal to two to the power of the elements in the former set (i.e. 2= 2^1, 4=2^2, 8=2^3, etc.) On the other hand, the real numbers are uncountable, as demonstrated by Cantor's famous diagonalization argument.