Let a = 2015 2015 a = \sqrt[2015]{2015} a = 2015 2015 . Note that a > 1 a > 1 a > 1 since 2015 > 1 2015 > 1 2015 > 1 .
We have a 1 = a a_1 = a a 1 = a and a n + 1 = a a n a_{n+1} = a^{a_n} a n + 1 = a a n for n ≥ 1 n \ge 1 n ≥ 1 .
Let us compute the first few terms:
a 1 = a a_1 = a a 1 = a
a 2 = a a 1 = a a a_2 = a^{a_1} = a^a a 2 = a a 1 = a a
a 3 = a a 2 = a a a a_3 = a^{a_2} = a^{a^a} a 3 = a a 2 = a a a
and so on.
Let us try to estimate a n a_n a n and see if it can ever reach 2015 2015 2015 .
First, note that a = 2015 1 / 2015 a = 2015^{1/2015} a = 201 5 1/2015 .
Let us compute a a a numerically:
ln a = 1 2015 ln 2015 \ln a = \frac{1}{2015} \ln 2015 ln a = 2015 1 ln 2015
ln 2015 ≈ 7.616 \ln 2015 \approx 7.616 ln 2015 ≈ 7.616 (since ln 2000 ≈ 7.601 \ln 2000 \approx 7.601 ln 2000 ≈ 7.601 )
So ln a ≈ 7.616 2015 ≈ 0.00378 \ln a \approx \frac{7.616}{2015} \approx 0.00378 ln a ≈ 2015 7.616 ≈ 0.00378
Thus, a ≈ e 0.00378 ≈ 1.00379 a \approx e^{0.00378} \approx 1.00379 a ≈ e 0.00378 ≈ 1.00379
So a a a is just slightly greater than 1 1 1 .
Now, a 2 = a a ≈ ( 1.00379 ) 1.00379 a_2 = a^a \approx (1.00379)^{1.00379} a 2 = a a ≈ ( 1.00379 ) 1.00379
Let us compute ln a 2 = a ln a ≈ 1.00379 × 0.00378 ≈ 0.00379 \ln a_2 = a \ln a \approx 1.00379 \times 0.00378 \approx 0.00379 ln a 2 = a ln a ≈ 1.00379 × 0.00378 ≈ 0.00379
So a 2 ≈ e 0.00379 ≈ 1.00380 a_2 \approx e^{0.00379} \approx 1.00380 a 2 ≈ e 0.00379 ≈ 1.00380
Similarly, a 3 = a a 2 ≈ ( 1.00379 ) 1.00380 a_3 = a^{a_2} \approx (1.00379)^{1.00380} a 3 = a a 2 ≈ ( 1.00379 ) 1.00380
ln a 3 = a 2 ln a ≈ 1.00380 × 0.00378 ≈ 0.00380 \ln a_3 = a_2 \ln a \approx 1.00380 \times 0.00378 \approx 0.00380 ln a 3 = a 2 ln a ≈ 1.00380 × 0.00378 ≈ 0.00380
So a 3 ≈ e 0.00380 ≈ 1.00381 a_3 \approx e^{0.00380} \approx 1.00381 a 3 ≈ e 0.00380 ≈ 1.00381
We see that a n a_n a n increases extremely slowly.
Let us try to estimate how large a n a_n a n can get.
Suppose a n ≈ 1 + c n a_n \approx 1 + c_n a n ≈ 1 + c n , where c n c_n c n is very small.
We see that a n + 1 = a a n = e a n ln a ≈ e ( 1 + c n ) ⋅ c 1 a_{n+1} = a^{a_n} = e^{a_n \ln a} \approx e^{(1 + c_n) \cdot c_1} a n + 1 = a a n = e a n l n a ≈ e ( 1 + c n ) ⋅ c 1 , where c 1 = ln a ≈ 0.00378 c_1 = \ln a \approx 0.00378 c 1 = ln a ≈ 0.00378 .
So a n + 1 ≈ e c 1 + c n c 1 ≈ 1 + c 1 + c n c 1 a_{n+1} \approx e^{c_1 + c_n c_1} \approx 1 + c_1 + c_n c_1 a n + 1 ≈ e c 1 + c n c 1 ≈ 1 + c 1 + c n c 1 (using e x ≈ 1 + x e^x \approx 1 + x e x ≈ 1 + x for small x x x ).
Thus, c n + 1 ≈ c 1 + c n c 1 c_{n+1} \approx c_1 + c_n c_1 c n + 1 ≈ c 1 + c n c 1
Let us try to see how c n c_n c n grows:
Let c 1 = ln a ≈ 0.00378 c_1 = \ln a \approx 0.00378 c 1 = ln a ≈ 0.00378
c 2 ≈ c 1 + c 1 2 ≈ 0.00378 + ( 0.00378 ) 2 ≈ 0.00378 + 0.0000143 ≈ 0.003794 c_2 \approx c_1 + c_1^2 \approx 0.00378 + (0.00378)^2 \approx 0.00378 + 0.0000143 \approx 0.003794 c 2 ≈ c 1 + c 1 2 ≈ 0.00378 + ( 0.00378 ) 2 ≈ 0.00378 + 0.0000143 ≈ 0.003794
c 3 ≈ c 1 + c 2 c 1 ≈ 0.00378 + 0.003794 × 0.00378 ≈ 0.00378 + 0.00001435 ≈ 0.0037944 c_3 \approx c_1 + c_2 c_1 \approx 0.00378 + 0.003794 \times 0.00378 \approx 0.00378 + 0.00001435 \approx 0.0037944 c 3 ≈ c 1 + c 2 c 1 ≈ 0.00378 + 0.003794 × 0.00378 ≈ 0.00378 + 0.00001435 ≈ 0.0037944
So c n c_n c n increases by about 0.000014 0.000014 0.000014 each time, which is extremely slow.
To reach a n ≥ 2015 a_n \ge 2015 a n ≥ 2015 , we need a n ≥ 2015 a_n \ge 2015 a n ≥ 2015 , i.e., c n ≥ 2014 c_n \ge 2014 c n ≥ 2014 .
But c n c_n c n increases by about 0.000014 0.000014 0.000014 per step, starting from 0.00378 0.00378 0.00378 .
So the number of steps required is roughly 2014 0.000014 ≈ 144 , 571 , 429 \frac{2014}{0.000014} \approx 144,571,429 0.000014 2014 ≈ 144 , 571 , 429 steps.
But actually, the increment per step increases slightly, but still, the growth is extremely slow.
Therefore, for all practical purposes, a n a_n a n will never reach 2015 2015 2015 for any reasonable n n n .
Thus, the answer is:
No, there does not exist a positive integer n n n such that a n ≥ 2015 a_n \ge 2015 a n ≥ 2015 .