Graham's number stable digits: An exact solution
Marco Rip\`a

TL;DR
This paper precisely determines the stable digits of Graham's number and related tetrations in base 3, revealing exact digit patterns and differences for large hyperexponents.
Contribution
It provides an exact characterization of the stable digits of Graham's number and related tetrations, extending understanding of their digit structure in base 3.
Findings
The last stable digits of Graham's number are determined by its super-logarithm.
The $ ext{slog}_3(G)$-th rightmost digit of Graham's number differs from that of higher tetrations.
The $ ext{slog}_3(^{n}3)$-th least significant digit of the difference is 4.
Abstract
In the decimal numeral system, we prove that the well-known Graham's number, (i.e., ( times)), and any base tetration whose hyperexponent is larger than share the same rightmost digits (where indicates the integer super-logarithm). This is an exact result since the -th rightmost digit of differs from the -th rightmost digit of . Furthermore, we show that the -th least significant digit of the difference between Graham's number and any base tetration whose integer hyperexponent exceeds is .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsHistory and Theory of Mathematics · Computability, Logic, AI Algorithms · Analytic Number Theory Research
