Useful theorem: If A is a finite alphabet and B is the set of all (finite) words that can be written using this alphabet, then B is countable.
• We can write any rational number as a finite word using the following finite alphabet {0,1,2,3,4,5,6,7,8,9,/,-}. Therefore the [1/7]