Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I know using Euler's Totient function, it's easy to find the last $n$ digits of Graham's number (or any large repeating power tower), but is there any known way to find the first $n$ digits of Graham's Number? How about in binary? Or in any base besides a power of 3?

share|improve this question
Can anyone think of any other good tags for this problem? big-numbers was all I could find –  dspyz Apr 17 '13 at 21:55
Finding the first $n$ digits is a completely different and much harder problem. Take a base-$10$ logarithm and you'll see that the problem boils down to computing the fractional part of the logarithm... –  Qiaochu Yuan Apr 17 '13 at 22:03
Related: mathoverflow.net/questions/20765/… –  Lord Soth Apr 17 '13 at 22:10

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.