Difference between revisions of "Googol"
From Encyclopedia of Mathematics
(Removed comparison with unclear meaning and no source) |
m (ce) |
||
| Line 8: | Line 8: | ||
The number $1$ followed by a googol of zeros is called the ''googolplex''. | The number $1$ followed by a googol of zeros is called the ''googolplex''. | ||
| − | The | + | The "Game of googol" is a betting game that is equivalent to the [[Secretary problem|secretary problem]]. It dates from around 1958 and is described in [[#References|[a2]]]. Its name derives from the fact that it does not matter how large the numbers are that are chosen in the game. |
====Comments==== | ====Comments==== | ||
| Line 14: | Line 14: | ||
====References==== | ====References==== | ||
| − | <table><TR><TD valign="top">[a1]</TD> <TD valign="top"> P. Montgomery, S. Cavallar, H. te Riele, "A new world record for the special number field sieve factoring method" ''CWI Quaterly'' , '''10''' : 2 (1997) pp. 105–107</TD></TR><TR><TD valign="top">[a2]</TD> <TD valign="top"> M. Gardner, "New mathematical diversions from Scientific Amer." , Simon&Schuster (1966) pp. 35–36; 41–43</TD></TR></table> | + | <table> |
| + | <TR><TD valign="top">[a1]</TD> <TD valign="top"> P. Montgomery, S. Cavallar, H. te Riele, "A new world record for the special number field sieve factoring method" ''CWI Quaterly'' , '''10''' : 2 (1997) pp. 105–107</TD></TR> | ||
| + | <TR><TD valign="top">[a2]</TD> <TD valign="top"> M. Gardner, "New mathematical diversions from Scientific Amer." , Simon&Schuster (1966) pp. 35–36; 41–43</TD></TR> | ||
| + | </table> | ||
Revision as of 18:13, 31 October 2014
The number \begin{equation*} 10^{100}, \end{equation*} having $100$ digits. In spite of this large size, such numbers can be worked with on modern (1998) networks of computers. See, e.g., [a1] for the factorization of the $108$-digit number $(12^{167}+1)/13$ into two prime factors of $75$ and $105$ digits, respectively.
The number $1$ followed by a googol of zeros is called the googolplex.
The "Game of googol" is a betting game that is equivalent to the secretary problem. It dates from around 1958 and is described in [a2]. Its name derives from the fact that it does not matter how large the numbers are that are chosen in the game.
Comments
Do not confuse with Google.
References
| [a1] | P. Montgomery, S. Cavallar, H. te Riele, "A new world record for the special number field sieve factoring method" CWI Quaterly , 10 : 2 (1997) pp. 105–107 |
| [a2] | M. Gardner, "New mathematical diversions from Scientific Amer." , Simon&Schuster (1966) pp. 35–36; 41–43 |
How to Cite This Entry:
Googol. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Googol&oldid=34119
Googol. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Googol&oldid=34119
This article was adapted from an original article by M. Hazewinkel (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article