michael_nielsen

Now there's a bit of a problem, which is this convention makes ...AAAA be written as just a blank. Obviously that would be unreadable. So we'll introduce an exception: for that, we'll write A, just as a kind of placeholder.

I don't claim, by the way, that this "universal counter" approach is necessarily _more_ obvious than what we were doing earlier. But it's at least plausible as an alternate. And it has the benefit that it's an attractively unified system.

Okay, so the way counting goes is: A, B, C, ..., Z, BA, BB, BC,...., and eventually on to BAA, BAB, and so on.

In this system, xy -> (x-1)*23+y. And xyz -> (x-1)*23*23+(y-1)*23+z. Those seem satisfyingly neat, and the pattern continues.

There is still a slightly ugly thing, which is the -1 terms, which show up over and over again. We could get rid of those if we decided to start counting at 1 -> B, 2 -> C, etc.

If we did that, then we'd have xy -> x*23+y, xyz -> x*23*23+y*23+z, and so on for longer strings. That's even simpler, though A is now playing pretty much the role of a placeholder.

At this point a clever designer might be bugged by the use of the alphabet in this number representation. After all, the alphabet is already being used for words! So it'd be better to switch to different symbols to prevent confusion.

The alternate symbols we use are pretty arbitrary. Let's go for A -> 0, B -> 1, C -> 2, and so on. Of course, we could introduce 23 new symbols. But the 23 is actually pretty arbitrary. So let's use just 10 symbols: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9.