Calculating digits of Grahams' Number

[madmike159]

I was reading random topics on Wikipedia the other day, and saw something about the first 500 numbers of Grahams' Number.

I want to create a program (probably in C#) to calculate as many digits from it as I can, but I haven't be able to make sense of the way it is done. Would someone be able to give me a hint of how the algorithm works. The only examples I was able to find were written in Python, which I wasn't really able to get my head around.

 

[Mark44]

I was reading random topics on Wikipedia the other day, and saw something about the first 500 numbers of Grahams' Number.

I want to create a program (probably in C#) to calculate as many digits from it as I can, but I haven't be able to make sense of the way it is done. Would someone be able to give me a hint of how the algorithm works. The only examples I was able to find were written in Python, which I wasn't really able to get my head around.

It would be helpful if you told us what Graham's number is, with maybe a link to an article about it and possibly the algorithm that you would like to implement in C#.

 

[madmike159]

Sorry, here is a link.
http://en.wikipedia.org/wiki/Graham's_number
It is so large it has to be written using the up arrow notation.
http://en.wikipedia.org/wiki/Knuth's_up-arrow_notation

Basically the bottom line is 3 \uparrow\uparrow\uparrow\uparrow 3

Basically I think you can calculate the right most decimal digits of the number using the modulus function recursively.