Saving Paper\text{Saving Paper}

===

"elephant" -> "AabA"

You have decided to create an efficient new language to save paper. The average person knows under 100,000100,000 words, so for 100,000100,000 different words, you assign a unique code using only capital and lowercase letters in the English alphabet (AA, aa, BB, bb, ...) 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 100,000100,000 different words?

Choose one answer

Type a concept, like “slope” or “photosynthesis”.

↑ ↓ to choose · Enter to openSearch explanations and problems