It is also known as the marriage problem, the sultan's dowry problem, the fussy suitor problem, the googol game, and the best choice problem.
The smallest number bigger than any finite number named by an expression in the language of set theory with a googol symbols or less.
A googolplex is much larger than a googol, but is still finite, as the inventor of the name was quick to point out.
Ban numbers are not precisely defined, since some large numbers do not follow the standards of number names (such as googol and googolplex).
If a googol is ten to the one hundredth, then a googolplex is one followed by a googol of zeroes.
One motivation for such a pursuit is that attributed to the inventor of the word "googol", who was certain that any finite number had to have a name.
