Noob <root@localhost> writes:

> Three Headed Monkey wrote:

>

>> write a program in "C" language that computes 9^(8^(7^(6^(5^(4^(3^(2^1)))))))

>

> (I know your post was written tongue-in-cheek, but it's an interesting

> problem nonetheless.)

>

> Let u1 = 1 and u(n) = n ^ u(n-1)

>

> Assume base 10.

>

> u1 = 1

> u2 = 2

> u3 = 9

> u4 = 262144

> u5 = a number with 183231 digits

> u6 = a number with (roughly) 10^183231 digits

>

> u9 might be larger than one googolplex.

>

> http://en.wikipedia.org/wiki/Googolplex
(Assuming, of course, that "^" denotes exponentiation.)

u5 is substantially larger than one googol (10^100); it has 183231

digits compared to just 101 digits for one googol.

u6 is substantially larger than one goolplex; it has 10^183231 digits,

compared to just 10^100+1 digits for one googolplex.

u7, u8, and u9 are Really Really Big (but still tiny compared to the

largest numbers that have actually been used in mathematics).

--

Keith Thompson (The_Other_Keith) <(E-Mail Removed)>

Nokia

"We must do something. This is something. Therefore, we must do this."

-- Antony Jay and Jonathan Lynn, "Yes Minister"