Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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|cite|improve this question
1  
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
2  
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
2  
Related: mathoverflow.net/questions/20765/… – Lord Soth Apr 17 '13 at 22:10
    
It will even be hopeless to calculate the FIRST digit of graham's number. – Peter Jan 12 at 20:20

Your Answer

 
discard

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

Browse other questions tagged or ask your own question.