Iterated Roots Convergence

Calculus Level 2

1 , 1 + 2 , 1 + 2 + 3 , \sqrt{1},\quad \sqrt{ 1 + \sqrt{2} },\quad \sqrt{ 1 + \sqrt{2 + \sqrt{3 } } },\quad \cdots

Consider the above sequence given by a n = 1 + 2 + 3 + + n a_n = \sqrt{ 1 + \sqrt{2 + \sqrt{3 + \cdots + \sqrt{n} } } } .

Does a n a_n converge?

No it diverges Yes it converges

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

3 solutions

Calvin Lin Staff
Nov 23, 2016

Let the sequence be x n = 1 + 2 + + n x_n = \sqrt{ 1 + \sqrt{ 2 + \ldots + \sqrt{n } } } . Clearly x n x_n is a monotonically increasing seqeunce. Thus, we just need to show that they have an upper bound, which shows that this sequence converges.

Claim: For all n n , x n 2 x_n \leq 2 .

Proof: By squaring all of the roots, we ultimately want to show that

P n : ( ( ( ( 2 2 1 ) 2 2 ) 2 3 ) 2 ) 2 n > 0 P_n: (((( 2^2 - 1 ) ^2 - 2 ) ^ 2 - 3 ) ^ 2 \ldots )^2 - n > 0

However, note that if this is true, that it doesn't yet allow us to conclude anything about P n + 1 P_{n+1} . Thus, we want to show something stronger , which allows us to proceed via induction. By playing around, we see that if

( ( ( ( 2 2 1 ) 2 2 ) 2 3 ) 2 ) 2 n > 3 ( n + 1 ) . (((( 2^2 - 1 ) ^2 - 2 ) ^ 2 - 3 ) ^ 2 \ldots )^2 - n > \sqrt{ 3(n+1) } .

is true for some n n , we can then conclude that

( ( ( ( ( 2 2 1 ) 2 2 ) 2 3 ) 2 ) 2 n ) 2 ( n + 1 ) > 3 ( n + 1 ) ( n + 1 ) = 2 ( n + 1 ) > 3 ( n + 2 ) ((((( 2^2 - 1 ) ^2 - 2 ) ^ 2 - 3 ) ^ 2 \ldots )^2 - n)^2 - (n+1) > 3(n+1) - (n+1) = 2 (n+1) > \sqrt{3 (n+2) }

This allows us to complete the induction step! Of course, there could be numerous possibilities for the RHS, like 2 n + 1 2 \sqrt{n+1} or \sqrt{2 (n+3) . I just chose this one first.

All that remains is to find a large enough base case where the inequality is true. In fact, this is already satisfied at n = 1 n = 1 since

2 2 1 = 3 > 3 × 2 . 2^2 - 1 = 3 > \sqrt{ 3 \times 2} .

Hence, we can proceed by induction.

Pranshu Gaba
Nov 23, 2016

We can compare the sequence a n a_n with another sequence b n = 1 + 2 + 3 + + n b_n = \left\lceil \sqrt{1 + \left\lceil \sqrt{2 + \left \lceil \sqrt{3 + \cdots + \left\lceil \sqrt{n} \right \rceil } \right\rceil}\right\rceil } \right\rceil . We see that b n a n b_n \ge a_n for all n n .

We see that b 1 = 1 b_1 = 1 . We can show that b n = 2 b_n = 2 for all n 2 n \ge 2 .

Since a n a_n is strictly increasing sequence, and it has an upper bound, it converges.

Michael Mendrin
Dec 3, 2016

This is the famous "Nested Radical Constant" with extensive literature on the subject. In particular, Vijayaraghavan proved that the sequence

a 1 + a 2 + a 3 + a 4 + . . . \sqrt { { a }_{ 1 }+\sqrt { { a }_{ 2 }+\sqrt { { a }_{ 3 } +\sqrt { { a }_{ 4 }\;+... } } } }

for positive a n {a}_{n} converges if and only if the Limit superior of L o g ( a n ) 2 n \dfrac { Log\left( { a }_{ n } \right) }{ { 2 }^{ n } } is less than infinity.

There is no known closed form expression for this Nested Radical Constant.

Could you please say what is Limit superior and inferior and how eebhave to find it sir?

Ramasubramaniyan Gunasridharan - 4 years, 6 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...