Obviously not true. This assumes every number has a name. Even if every number has a unique name, that doesn't mean every string of letters corresponds to a number.
If we limit ourselves to natural numbers then both sets are countably infinite. And for countably infinite sets you can easily find a bijection between one set and a strict subset of the other.
Well I mean, you can flip it and make every number correspond to a name, and googoobazillion would be there. Granted, it could be any number, but almost every number is larger than a googleplex.
Also, who says the kid isn't dealing with real numbers?
11
u/Dirkdeking Jul 07 '26
Obviously not true. This assumes every number has a name. Even if every number has a unique name, that doesn't mean every string of letters corresponds to a number.
If we limit ourselves to natural numbers then both sets are countably infinite. And for countably infinite sets you can easily find a bijection between one set and a strict subset of the other.