User blog comment:Wythagoras/Proof that TREE(n+1) divided by TREE(n) is strictly increasing/@comment-223.255.230.227-20141220074940

nice proof! how about this:   is there a maximum m   so that TREE(n) > TREE(n-1)^m   ? here TREE(n-1)^m    means the m-th power of TREE(n-1)       in other words, is m has a limit?