1 , 1 + 2 , 1 + 2 + 3 , ⋯
Consider the above sequence given by a n = 1 + 2 + 3 + ⋯ + n .
Does a n converge?
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.
We can compare the sequence a n with another sequence b n = ⌈ 1 + ⌈ 2 + ⌈ 3 + ⋯ + ⌈ n ⌉ ⌉ ⌉ ⌉ . We see that b n ≥ a n for all n .
We see that b 1 = 1 . We can show that b n = 2 for all n ≥ 2 .
Since a n is strictly increasing sequence, and it has an upper bound, it converges.
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 + . . .
for positive a n converges if and only if the Limit superior of 2 n L o g ( a 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?
Problem Loading...
Note Loading...
Set Loading...
Let the sequence be x n = 1 + 2 + … + n . Clearly 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 , x n ≤ 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
However, note that if this is true, that it doesn't yet allow us to conclude anything about 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 ) .
is true for some 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 )
This allows us to complete the induction step! Of course, there could be numerous possibilities for the RHS, like 2 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 since
2 2 − 1 = 3 > 3 × 2 .
Hence, we can proceed by induction.