Mathematics under The Library of Babel
221124
- To hold all occasions of
a-z, a single character, requires 26 characters. - ASCII: 128
- Considering any Unicode can be ASCII escaped, Unicode LoB will use the same equation but takes a much longer ASCII base string
- For two characters to hold all possible sequences, what should be the shortest sequence?
- Naively, it may take where is all the combinations, and 2 is the length of a single combination.