I mean, of course $e^{e^9}$ is not an integer, but can we prove this? If you're thinking of asking WolframAlpha, be warned: it gives different answers to the questions "is exp(exp(9)) an integer" (WA says "No") and "is exp(exp(9.0)) an integer" (WA says "Yes").

Yes, you can. ${}$ – Pedro Apr 22 '15 at 01:20

If you can prove: for some $n$: $n < e^{e^{9}} < n+1$, then it is not an integer. – DeepSea Apr 22 '15 at 01:23

To be more specific, since $e^9\approx 8100$, the integer part of $e^{e^9}$ is only about 10K bits (plus or minus) so it wouldn't be hard to compute first $e^9$ and then $e^{e^9}$ to sufficient accuracy to prove it's not an integer. (Note that we can compute $e^x$ to $n$ bits of accuracy in time approximately $M(n)$, where $M(n)$ is the time to multiply two $n$bit numbers). – Steven Stadnicki Apr 22 '15 at 01:28

Just curious, why did you say "of course"? – Quang Hoang Apr 22 '15 at 01:30

Just intuition. – Alon Amit Apr 22 '15 at 01:34

3@AlonAmit: It has probability $1$ of being right. – André Nicolas Apr 22 '15 at 01:34

1Perhaps we should try to prove the more general: $e^{e^n}\not\in\mathbb N$ for $n\in\mathbb N$. – Akiva Weinberger Apr 22 '15 at 02:00

4@CarlMummert I don't think that's a duplicate; $e^{e^9}$ is within the realm of computation whereas $e^{e^{e^{79}}}$ is decidedly in the realm of theory  and that's expressed as a pretty big difference in terms of the answers these questions have received. – Milo Brandt Apr 22 '15 at 02:06

@StevenStadnicki If in PARI/GP you first do `default(realprecision, 3600)` meaning all calculations with "real" numbers are done with 3600 decimal digits (in fact, for technical reasons it gives you 3602 in this case, I am using a Windows gp.exe binary for 64bit), then the function `frac(exp(exp(9)))` gives you $0.3414\ldots$. I am quite confident the PARI/GP calculator is right here. (Of course, if you do not set up `realprecision`, PARI/GP will produce an error if you try to do `frac(exp(exp(9)))`, namely _frac: precision too low in truncr (precision loss in truncation)._) – Jeppe Stig Nielsen Dec 18 '16 at 22:23
2 Answers
We could prove it is not an integer by providing explicit bounds. If you really wanted to, you could note the following common inequality, holding for all positive $n$: $$\left(1+\frac{1}n\right)^n<e<\left(1+\frac{1}n\right)^{n+1}.$$ Which yields a series of rational bounds for $e$, where both sides converge to $e$ as $n$ heads to infinity. The point here is that, if we know that $x$ is in the interval $\left[\frac{a}n,\frac{b}{n+1}\right]$, then it follows that $$\left(1+\frac{1}n\right)^{a}<e^x<\left(1+\frac{1}n\right)^{b}.$$ Taking such an approximation for large enough integer $n$ yields arbitrarily tight rational bounds on $e^x$. From those bounds, you can prove bounds on $e^{e^x}$. I would imagine that you need to find fairly tight bounds, but it's nothing a computer couldn't do.
Now figuring out if it's rational... that's a different story.
Okay, having actually tried to make my computer do the above, it turns out that $e^x$ grows really fast near $x=e^9$ and that the above bounds work in theory, but only slowly. It doesn't quite cut it unless your computer is bigger than mine. We could swap out whatever bounds we want though  for instance, a crude bound arising from the series for $e^x$ is (assuming $x$ is positive and $n\geq 2x$). $$\left(\sum_{i=0}^n\frac{x^i}{n!}\right)<e^x<\left(\sum_{i=0}^n\frac{x^i}{n!}\right)+\frac{x^n}{n!}$$ converges much faster, and would probably yield the desired bound with some effort. You could also try rounding rationals down (in the lower bound) and up (in the upper bound) to shave some time off doing exact rational arithmetic.
 58,703
 5
 98
 184
Fleshing out my comment into an answer: we know that $e^9\approx 8100$, so that the integer part of $e^{e^9}$ is roughly 12,000 bits. This means that we can get a value to sufficient accuracy by:
 Computing $e$ to 'sufficient' accuracy (being conservative, $2^{16}$ bits should be enough here; it's not hard to do a more accurate error analysis, but the number is small enough that we can afford to be sloppy).
 Computing $e^9$ to similar accuracy (likely by just squaring $e$ three times and multiplying by $e$, if I were going to do this with a quick manual application) and then computing $\frac{e^9}{8192}$ (a different number could be used here to make the next steps converge faster, but that's just tuning).
 Computing $e^{e^9/8192}$; since $\frac{e^9}{8192}\lt 1$, this can be done fairly efficiently.
 Finally, computing $e^{e^9}=(e^{e^9/8192})^{8192}$ by repeated squaring.
As mentioned, none of these operations should need to work on numbers much longer than about $2^{16}$ bits, which means that all of these values will fit comfortably in memory and nothing will take more than a few million bitoperations to compute. You could probably do this to sufficient accuracy on a modern processor in well under a minute. And critically, explicit error bounds are available for the algorithms for all of these operations, so that you can assure yourself that errors won't magnify enough to swamp the result.
 50,003
 9
 78
 143