Graham’s number is an upper bound in a problem in Ramsey theory, first mentioned in a paper by Ronald Graham and B. Rothschild. The Guinness Book of World Records calls it the largest number ever used in a mathematical proof. Graham’s number is too difficult to write in scientific notation, so it is generally written using Knuth’s arrow-up notation. In Graham’s paper, the bound is given as
where is the least natural number such that implies that given any arbitrary -coloring of the line segments between pairs of vertices of an -dimensional box, there must exist a monochromatic rectangle in the box.
Here is the function defined by (this is a direct quote):
In the earlier paper Graham and Rothschild called this function instead of , and commented: “Clearly, there is some room for improvement here.”
In Knuth’s arrow-up notation, Graham’s number is still cumbersome to write: we define the recurrence relation and . Graham’s number is then .
We don’t know what the most significant base 10 digits of Graham’s number are, but we do know that the least significant digit is 7 (and of course 0 in base 3).
Graham’s number has its own entry in Wells’s Dictionary of Curious and Interesting Numbers, it is the very last entry, right after Skewes’ number, which it significantly dwarfs, and which was once also said to be the largest number ever used in a serious mathematical proof.
- 1 M. P. Slone, PlanetMath message, March 19, 2007.
- 2 R. L. Graham and B. L. Rothschild, “Ramsey’s theorem for -parameter sets”, Trans. Amer. Math. Soc., 159 (1971): 257 - 292
- 3 R. L. Graham and B. L. Rothschild. Ramsey theory. Studies in combinatorics, ed. G.-C. Rota, Mathematical Association of America, 1978.
|Date of creation||2013-03-22 17:15:15|
|Last modified on||2013-03-22 17:15:15|
|Last modified by||PrimeFan (13766)|