Here :


Saibian demonstrates that for very large numbers $N$, $N\uparrow\uparrow N$ is only "slightly larger" than $N$.

I would like to demonstrate it for the number

$$N=4\uparrow^4 4=4\uparrow^3 4\uparrow^3 4\uparrow^3 4$$

I want to bound $N\uparrow\uparrow N$ from above. I think $4\uparrow^5 4$ would be an upper bound, but even if this is the case, I would like to find a better upper bound.

For which $k$ do we have $4\uparrow\uparrow\uparrow k>N\uparrow\uparrow N\ $ ?

The value $k$ should be near $4\uparrow^3 4\uparrow^3 4$. This would show that $N\uparrow\uparrow N$ is "not much larger" than $N$.

  • $\begingroup$ @Deedlit another small exercise with up-arrows :) $\endgroup$ – Peter Jun 5 '16 at 18:25

Letting $M = 4\uparrow^3 4 \uparrow^3 4$, we have

$$ 4\uparrow^3(M+1) = 4 \uparrow\uparrow (4 \uparrow^3 M) = 4\uparrow\uparrow N < N \uparrow\uparrow N$$


$$ 4 \uparrow^3 (M+2) = 4\uparrow\uparrow (4 \uparrow\uparrow (4 \uparrow^3 M)) = 4\uparrow\uparrow (4 \uparrow\uparrow N) > 4 \uparrow\uparrow (2N) > (4 \uparrow\uparrow N) \uparrow\uparrow N > N \uparrow\uparrow N $$

  • $\begingroup$ Wow, wonderful answer! I did not expect that $(4\uparrow^3 4\uparrow^3 4)+2$ would already be sufficient. $\endgroup$ – Peter Jun 6 '16 at 8:40
  • $\begingroup$ Your second line can be replaced by an immediate application of Saibian's theorem: $4\uparrow^3(M+2)>(4\uparrow^3M)\uparrow^32=N\uparrow\uparrow N$. $\endgroup$ – r.e.s. Jun 14 '16 at 2:44
  • $\begingroup$ Also, it might be worth noting that the above proof, mutatis mutandis, shows that if $n=b\uparrow^p m$ with $b\ge 2,\ p\ge 3,\ m\ge 1$, then $b\uparrow^p(m+1)\le n\uparrow^{p-1}n<b\uparrow^p(m+2)$. $\endgroup$ – r.e.s. Jun 14 '16 at 2:46

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.