Practice problem
Intro to Exponential Growth
===

You have decided to create an efficient new language to save paper. The average person knows under words, so for different words, you assign a unique code using only capital and lowercase letters in the English alphabet (, , , , ...) and each word will have the same number of characters.
You want the codes to be as short as possible. How short can your codes be while still being able to uniquely cover different words?