1 ... 4 ... 19,683 ... ?
1 ... 4 ... 7,625,597,484,987 ... ?
The answer to the first series is a mere
340,282,366,920,938,463,463,374,607,431,7
The second, as you can probably guess, is larger. Much larger. In fact, it's exactly
226,815,615,859,885,194,199,148,049,996,4
or approximately
5 x 108,072,304,726,028,225,379,282,369,632,41
Even more approximately, that's
5 x 108 x 10153
Time to play with some big numbers:
5 x 10googol x 8 x 1053
5 x googolplex8,000 x 1050
5 x googolplex8,000 √googol
However I put it, that is one very big number, almost impossible to visualise - Asimov's essay Skewered! details just how hard to visualise big numbers can be. Final challenge, if you want to prove that you actually solved the puzzle: explain how the series was derived.
September 5 2003, 13:44:26 UTC 17 years ago
1 , 22, 333, 4444
and a similar thing for the second one but instead of there being n recursions of "powers of n", there are n! recursions of "powers of n".
Yay HTML! :-)
September 5 2003, 14:00:11 UTC 17 years ago
Actually, they're poth the series you gave, just calculated in oposite directions, the first being
1, 22, (33)3, ((44)4)4
and the second
1, 22, 3(33), 4(4(44))