Graham's number

Graham's number is an immense number that arose as an upper bound on the answer of a problem in the mathematical field of Ramsey theory. It is much larger than many other large numbers such as Skewes's number and Moser's number, both of which are in turn much larger than a googolplex. As with these, it is so large that the observable universe is far too small to contain an ordinary digital representation of Graham's number, assuming that each digit occupies one Planck volume, possibly the smallest measurable space. But even the number of digits in this digital representation of Graham's number would itself be a number so large that its digital representation cannot be represented in the observable universe. Nor even can the number of digits of ''that'' number—and so forth, for a number of times far exceeding the total number of Planck volumes in the observable universe. Thus Graham's number cannot be expressed even by physical universe-scale power towers of the form $a ^$.

However, Graham's number can be explicitly given by computable recursive formulas using Knuth's up-arrow notation or equivalent, as was done by Ronald Graham, the number's namesake. As there is a recursive formula to define it, it is much smaller than typical busy beaver numbers. Though too large to be computed in full, the sequence of digits of Graham's number can be computed explicitly via simple algorithms; the last 13 digits are ...7262464195387. With Knuth's up-arrow notation, Graham's number is $g_$, where
$g_n = \left\ \text$

where the number of ''arrows'' in each subsequent layer is specified by the value of the next layer below it; that is,

$G = g_,$ where $g_1=3\uparrow\uparrow\uparrow\uparrow 3,$ $g_n = 3\uparrow^3,$

and where a superscript on an up-arrow indicates how many arrows there are. In other words, ''G'' is calculated in 64 steps: the first step is to calculate ''g''₁ with four up-arrows between 3s; the second step is to calculate ''g''₂ with ''g''₁ up-arrows between 3s; the third step is to calculate ''g''₃ with ''g''₂ up-arrows between 3s; and so on, until finally calculating ''G'' = ''g''₆₄ with ''g''₆₃ up-arrows between 3s.

Equivalently,
$G = f^(4),\textf(n) = 3 \uparrow^n 3,$

and the superscript on ''f'' indicates an iteration of the function, e.g., $f^4(n) = f(f(f(f(n))))$. Expressed in terms of the family of hyperoperations $\text_0, \text_1, \text_2, \cdots$, the function ''f'' is the particular sequence $f(n) = \text_(3,3)$, which is a version of the rapidly growing Ackermann function ''A''(''n'', ''n''). (In fact, $f(n) > A(n, n)$ for all ''n''.) The function ''f'' can also be expressed in Conway chained arrow notation as $f(n) = 3 \rightarrow 3 \rightarrow n$, and this notation also provides the following bounds on ''G'':

$3\rightarrow 3\rightarrow 64\rightarrow 2 < G < 3\rightarrow 3\rightarrow 65\rightarrow 2.$

Magnitude

To convey the difficulty of appreciating the enormous size of Graham's number, it may be helpful to express—in terms of exponentiation alone—just the first term (''g''₁) of the rapidly growing 64-term sequence. First, in terms of tetration ($\uparrow\uparrow$) alone:
$g_1 = 3 \uparrow \uparrow \uparrow \uparrow 3 = 3 \uparrow \uparrow \uparrow (3 \uparrow \uparrow \uparrow 3) = 3 \uparrow\uparrow (3 \uparrow\uparrow (3 \uparrow\uparrow \ \dots \ (3 \uparrow\uparrow 3) \dots ))$

where the number of 3s in the expression on the right is
$3 \uparrow \uparrow \uparrow 3 = 3 \uparrow \uparrow (3 \uparrow \uparrow 3).$

Now each tetration ($\uparrow\uparrow$) operation reduces to a power tower ($\uparrow$) according to the definition
$3 \uparrow\uparrow X = 3 \uparrow (3 \uparrow (3 \uparrow \dots (3 \uparrow 3) \dots )) = 3^$ where there are ''X'' 3s.

Thus,
$g_1 = 3 \uparrow\uparrow (3 \uparrow\uparrow (3 \uparrow\uparrow \ \dots \ (3 \uparrow\uparrow 3) \dots )) \quad \text \quad 3 \uparrow \uparrow (3 \uparrow \uparrow 3)$

becomes, solely in terms of repeated "exponentiation towers",
$g_1 = \left. \begin3^\end \right \} \left. \begin3^\end \right \} \dots \left. \begin3^\end \right \} 3 \quad \text \quad \left. \begin3^\end \right \} \left. \begin3^\end \right \} 3$

and where the number of 3s in each tower, starting from the leftmost tower, is specified by the value of the next tower to the right.

In other words, ''g''₁ is computed by first calculating the number of towers, $n = 3\uparrow (3\uparrow (3\ \dots\ \uparrow 3))$ (where the number of 3s is $3\uparrow (3\uparrow 3) = 7625597484987$), and then computing the ''n''^th tower in the following sequence:

1st tower: 3

2nd tower: 3↑3↑3 (number of 3s is 3) = 7625597484987

3rd tower: 3↑3↑3↑3↑...↑3 (number of 3s is 7625597484987) = …

⋮

''g''₁ = ''n''^th tower: 3↑3↑3↑3↑3↑3↑3↑...↑3 (number of 3s is given by the ''n-1''^th tower)

where the number of 3s in each successive tower is given by the tower just before it. Note that the result of calculating the third tower is the value of ''n'', the number of towers for ''g''₁.

The magnitude of this first term, ''g''₁, is so large that it is practically incomprehensible, even though the above display is relatively easy to comprehend. Even ''n'', the mere ''number of towers'' in this formula for ''g''₁, is far greater than the number of Planck volumes (roughly 10¹⁸⁵ of them) into which one can imagine subdividing the observable universe. And after this first term, still another 63 terms remain in the rapidly growing ''g'' sequence before Graham's number ''G'' = ''g''₆₄ is reached. To illustrate just how fast this sequence grows, while ''g''₁ is equal to $3 \uparrow \uparrow \uparrow \uparrow 3$ with only four up arrows, the number of up arrows in ''g''₂ is this incomprehensibly large number ''g''₁.

Rightmost decimal digits

Graham's number is a "power tower" of the form 3↑↑''n'' (with a very large value of ''n''), so its rightmost decimal digits must satisfy certain properties common to all such towers. One of these properties is that ''all such towers of height greater than d (say), have the same sequence of d rightmost decimal digits''. This is a special case of a more general property: The ''d'' rightmost decimal digits of all such towers of height greater than ''d''+2, are ''independent'' of the topmost "3" in the tower; i.e., the topmost "3" can be changed to any other non-negative integer without affecting the ''d'' rightmost digits.

The following table illustrates, for a few values of ''d'', how this happens. For a given height of tower and number of digits ''d'', the full range of ''d''-digit numbers (10^''d'' of them) does ''not'' occur; instead, a certain smaller subset of values repeats itself in a cycle. The length of the cycle and some of the values (in parentheses) are shown in each cell of this table:

The particular rightmost ''d'' digits that are ultimately shared by all sufficiently tall towers of 3s are in bold text, and can be seen developing as the tower height increases. For any fixed number of digits ''d'' (row in the table), the number of values possible for 3$\scriptstyle\uparrow$3↑…3↑''x'' mod 10^''d'', as ''x'' ranges over all nonnegative integers, is seen to decrease steadily as the height increases, until eventually reducing the "possibility set" to a single number (colored cells) when the height exceeds ''d''+2.

A simple algorithm for computing these digits may be described as follows: let x = 3, then iterate, ''d'' times, the assignment ''x'' = 3^''x'' mod 10^''d''. Except for omitting any leading 0s, the final value assigned to ''x'' (as a base-ten numeral) is then composed of the ''d'' rightmost decimal digits of 3↑↑''n'', for all ''n'' > ''d''. (If the final value of ''x'' has fewer than ''d'' digits, then the required number of leading 0s must be added.)

Let ''k'' be the numerousness of these ''stable'' digits, which satisfy the congruence relation G(mod 10^''k'')≡ ^Gmod 10^''k'').

''k''=''t''-1, where G(''t''):=3↑↑''t''. It follows that, .

The algorithm above produces the following 500 rightmost decimal digits of Graham's number ():

...02425950695064738395657479136519351798334535362521
43003540126026771622672160419810652263169355188780
38814483140652526168785095552646051071172000997092
91249544378887496062882911725063001303622934916080
25459461494578871427832350829242102091825896753560
43086993801689249889268099510169055919951195027887
17830837018340236474548882222161573228010132974509
27344594504343300901096928025352751833289884461508
94042482650181938515625357963996189939679054966380
03222348723967018485186439059104575627262464195387

References

Bibliography

* ; reprinted (revised) in Gardner (2001), cited below.
*
*
* The explicit formula for ''N'' appears on p. 290. This is not the "Graham's number" ''G'' published by Martin Gardner.
* On p. 90, in stating "the best available estimate" for the solution, the explicit formula for ''N'' is repeated from the 1971 paper.

External links

*

Sbiis Saibian's article on Graham's number
*

by Geoff Exoo








Some Ramsey results for the n-cube
prepublication mentions Graham's number
*
* Archived a
Ghostarchive
and th
Wayback Machine

* Archived a
Ghostarchive
and th
Wayback Machine


The last 16 million digits of Graham's number
by the Darkside communication group

{{DEFAULTSORT:Graham's Number
Ramsey theory
Integers
Large integers