The set {a..z} is bigger than the set {0..9}. But the set of all possible strings using arbitrary amounts of elements of {a..z} and the set of all possible strings using arbitrary amounts of elements of {0..9} are equally infinite. They have the same cardinality i.e. same size. Both are countable sets.
Consider this: which set is bigger, the set of all integers when you write them in binary, or the set of all integers when you write them in decimal? It's clear that they are the same set, written down using different representations.
The alphabet, a-z, could be considered a way of representing numbers in base 26. There's a 1:1 mapping from the set of all integers written in binary to the set of all integers written in decimal, base 26, or any other base. They're all equally infinite.
Both are infinite, but the set of real numbers is bigger than the set of integers, in the sense that there is no 1:1 mapping from real numbers to integers. In any mapping of integers to real numbers, there will always be at least one real number that has no corresponding integer. Per Cantor's diagonal argument.Originally Posted by o_O
The fact that integers are a subset of real numbers doesn't matter. Cardinality of infinite sets isn't a straightforward topic. Which set has more elements, the set of odd integers, or the set of all integers? Turns out they have the same cardinality, even though the set of odd numbers is a subset of the set of integers.



					
						
					
					
					
						
  Reply With Quote