Tetration convergence: prove $\lim_{x\rightarrow0} {}^{n}x = \begin{cases} 1, & n \text{ even} \\ 0, & n \text{ odd} \end{cases}$ I'm a computer student, learning math just for fun. Today I was graphing for fun that I found something strange! I noticed that that wired function ${x^{x^{\cdot^{\cdot^{x}}}}}$ in zero, seems to converge to 1 when there are even powers and to 0 when there are odd powers! Then I attempt to prove it but I failed.
Then I did a little research and I found the Tetration article on Wikipedia. This article says that my guess was right but without any proof. So I'm here to ask you about it.

If we define ${x^{x^{\cdot^{\cdot^{x}}}}}$ as ${^{n}x} :=\begin{cases} 1 &\text{if }n=0 \\ x^{\left(^{(n-1)}x\right)} &\text{if }n>0 \end{cases}$
then prove:
$$\lim_{x\rightarrow0} {}^{n}x = \begin{cases}   1, & n \text{ even} \\  0, & n \text{ odd} \end{cases}$$


Sorry, I'm leaving an answer so I can show an image. Note the red colored large kidney in the center of the image.  It is the location of period one convergence and is referred to as the Shell-Thron Region (STR). Immediately to left of the center of the STR is a small yellow disk of period two convergence. Note that $^{\infty}1 = 1$ is at the center of the STR where $^{\infty}a = a$, while center of the yellow disk is $0$. 
A pragmatic answer is that $1$ drives the dynamics of the surrounding exponential Mandelbrot map and that $0$ does the same, therefore $0^0=1$. In combinatorics it is common to take $0^0$ as $1$.
