Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I got this problem from my teacher as a optional challenge. I am open about this being a given problem, however it is not homework.

The problem is stated as follows. Assume we have an infinite tetration as follows

$$ \Large x^{x^{x^{.^{.^.}}}} \, = \, a$$

With a given $a$ find $x$. The next part of the problem was to discuss the convergence radius of a. If a is too big or too small the tetration does not converge.

Below is my humble stab at the problem.

My friend said you would have to treat the tetration as a infinnite serie, and therefore coul not perform algebraic manipulations on it before it is know wheter it converges or diverges.

However my attempt is to first do some algebraic steps, then discuss the convergence radius.

I) Initial discussion

At the start it is obvious that the tetration converges when $a=1$ (just set $x=1$) Now after some computer hardwork it seems that the tetration fails to converge when a is roughly larger than 3.

II) Algebraic manipulation

$$ \Large x^{x^{x^{.^{.^.}}}} \, = \, a$$

This is the same as

$$ \Large x^a \, = \, a$$

$$ \Large \log_a(x^a) \, = \, \log_a(a)$$

$$ \Large \log_a(x) \, = \, \frac{1}{a}$$

$$ \Large x \, = \, a^{\frac{1}{a}}$$

Now, if we let $a=2$ then $x = sqrt{2}$. After some more computational work, this seems to be correct. Which makes me belive this fomula is correct.

III) Discsussion about convergence

By looking at the derivative of $ \displaystyle \large a^{\frac{1}{a}} $ we see that the maxima occurs when $a=e$. Which also seems to correspond with the inital computational work. Now I think, that the minima of $\displaystyle \large a^{1/a}$ is zero, by looking at its graph. And study its derivative and endpoints.

So that my "guess" or work shows that a converges when

$$ a \in [0 \, , \, 1/e] $$

VI) My questions

Can my algebraic manipulations be justified? They seem rather sketchy taking the a`th logarithm and so on . (Although they seem to "magicaly" give out the right answer)

By looking at wikipedia it seems that the tetration converge when $$ \large a \in \left[ 1/e \, , \, e \right] $$

This is almost what I have, why is my lower bound worng? How can I find the correct lower bound?

share|cite|improve this question
Perhaps you want to take a look at this question : I must say though it is not a duplicate question, but the question you ask is related. (This link is dealing with $a=2$ and maybe other users will think of some other linked questions)… – Patrick Da Silva Feb 11 '12 at 22:50
I am confident that there is probably an answer to this question already written out on this website. – Patrick Da Silva Feb 11 '12 at 22:50
Yes, I actually searched before asking I could not find anything dealing with the generall case. Nor anything dealing with how to find the lower bound. Also this is not a straight duplicate, as I ask if my method is correct. =) – N3buchadnezzar Feb 11 '12 at 23:06
Recall that the logarithm function is a multi-valued function in the complex numbers... "taking the log" might be nasty, as detailed in the link I've added, we had issues with that. Maybe there's a link in my linked question you could take a look at. – Patrick Da Silva Feb 11 '12 at 23:13
Look at $x, x^x, x^{x^x}, \ldots$. In other words, starting with $a_0 = x$ and then $a_{n+1}=x^{a_n}$, you would want $\lim_{n \to \infty} a_n = a$. This does not converge if $x \lt e^{-e}$. – Henry Feb 11 '12 at 23:34
up vote 8 down vote accepted

First, I would recommend reading "Exponentials Reiterated" by R.A.Knoebel, It is by far the most comprehensive resource on infinite tetration. Second, your question might have been answered sooner if you had posted on the Tetration Forum, Lastly, I think it is very encouraging to see others interested in this subject, since I've been interested in it for quite a long time now.

share|cite|improve this answer
Funny, I linked to that in this answer... whose corresponding questions was what Pat was pointing to in the comments. – J. M. Feb 15 '12 at 17:03
Hi, welcome Andy at MSE! Good to hear of you after a long time... – Gottfried Helms Feb 15 '12 at 17:17

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

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