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

i mean the inequality will fail if m=ceil(log_3 TREE(3))-1.0000001      so m=ceil(log_3 TREE(3))-1    is the limit          in other words  m=ceil(log_3 TREE(3))-1+c    if c>0   then the inequality will fail