Comment by evanb
11 years ago
Using the infix special form ~ we can cram in another ^#:
u[n_][a_,b_]:=If[n==0,a b,Nest[a~u[n-1]~#&,1,b]];Nest[#~u[#^#^#^#]~#&,9,9~u@9~9]
I should also note that I'm not confident as to which of
Nest[#~u[#^#^#^#]~#&,9,9~u@9~9]
Nest[#~u@#~#&,9,9~u[9^9^9^9]~9]
is larger.
Very nice. Mathematica can clearly do the job. But I feel like there is still a lot of room for improvement. Clearly though, the proof would be more and more difficult.
Here is my modification:
82 chars total.
comments:
Smart. It didn't occur to me to have the base case be an arbitrary function. Yours is much larger than mine. One comment: M=Nest; is a waste of characters. I tried that in my solution too, but it wound up costing me an extra character ;). So I think you're down to 75 characters. It might make sense to remove the factorial, and change the base case of u to f@f@f@f@a.
Thanks, I forgot to remove M=Nest that was beneficial in my previous attempts where I used 3 Nests.
But remember:
Never forget that it is a waste of energy to do the same thing twice, and that if you know precisely what is to be done, you need not do it at all. --- E. E. ``Doc'' Smith (1930)
http://djm.cc/bignum-results.txt
So I would recommend to avoid things like f@f@f@f@a where there is clearly a pattern.
I think there might be a nice way to use #0 to blow up the numbers even further. But I have to do real work :)