# countability of a set

Is this set countable or uncountable?

"Set of binary strings of length greater than 30"

not sure if length can be infinite or has to be considered finite. For every binary string we can map it to the corresponding decimal value in the set of natural numbers. But if length becomes infinite then decimal value would not exist. It becomes confusing after this.

• If you admit the infinite string then this set is uncountable. However if you does not admit infinite string then the given set is countable. – Hanul Jeon Sep 26 '13 at 16:26

You can forget the $30$. Why? Let $A$ be the set of all strings (of any length) and $B$ be the set of a strings of length $> 30$. There is an injection $A \to B$ by sending a string to the same string with $31$ zeros appended to the beginning; and there is an injection $B \to A$ by sending a string to itself. By the Cantor-Bernstein-Schroeder theorem, $A$ and $B$ have the same cardinality. So $A$ is countable (resp. uncountable) if and only if $B$ is countable (resp. uncountable).
• If you allow infinite strings, use a diagonal argument (or a bijection with $\mathbb{R}$ or $[0,1]$ or whatever) to prove uncountability;