It Telescopes?

Calculus Level 3

Let { a n } \{a_{n}\} be a sequence of real numbers satisfying { a 0 = 1 a n + 1 = 4 + 3 a n + a n 2 2 for n 0. \begin{cases} a_{0}=1 \\ a_{n+1}=\sqrt{4+3a_{n}+a_{n}^{2}}-2 & \text{for } n \ge 0. \end{cases} Let S = n = 0 a n \displaystyle S=\sum_{n=0}^{\infty} a_{n} .

  • If S S converges, submit your answer as 100 S \big\lfloor 100S \big\rfloor .
  • If S S diverges, submit your answer as 1 -1 .

This problem is based on a recent Putnam contest problem.


The answer is 500.

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.

4 solutions

Relevant wiki: Convergence - Ratio Test

a n + 1 = 4 + 3 a n + a n 2 2 a n + 1 + 2 = 4 + 3 a n + a n 2 ( a n + 1 + 2 ) 2 = 4 + 3 a n + a n 2 a n + 1 2 + 4 a n + 1 + 4 = a n 2 + 3 a n + 4 a n + 1 2 + 4 a n + 1 = a n 2 + 3 a n \begin{aligned} a_{n+1} & = \sqrt{4+3a_n+a_n^2} - 2 \\ a_{n+1} + 2 & = \sqrt{4+3a_n+a_n^2} \\ \left(a_{n+1} + 2\right)^2 & = 4+3a_n+a_n^2 \\ a_{n+1}^2 + 4a_{n+1} + 4 & = a_n^2 + 3a_n + 4 \\ a_{n+1}^2 + 4a_{n+1} & = a_n^2 + 3a_n \end{aligned}

From the above, we note that if a n > 0 a_n > 0 , then 0 < a n + 1 < a n 0 < a_{n+1} < a_n . Since a 0 = 1 a_0 = 1 , we have 0 < a n < a 0 = 1 0 < a_n < a_0 = 1 . This means that a n a_n is strictly decreasing and that as n n \to \infty , a n 0 a_n \to 0 . From a n + 1 2 + 4 a n + 1 = a n 2 + 3 a n a_{n+1}^2 + 4a_{n+1} = a_n^2 + 3a_n , and as n n \to \infty then a n 2 a n + 1 2 a_n^2 \to a_{n+1}^2 , 4 a n + 1 = 3 a n \implies 4a_{n+1} = 3a_n , a n + 1 a n = 3 4 \implies \dfrac {a_{n+1}}{a_n} = \dfrac 34 .

Therefore, lim n a n + 1 a n = 3 4 < 1 \displaystyle \implies \lim_{n \to \infty} \left|\frac {a_{n+1}}{a_n} \right| = \dfrac 34 < 1 and by ratio test n = 0 a n \displaystyle \sum_{n=0}^\infty a_n converges. Then, we have:

a n + 1 2 + 4 a n + 1 = a n 2 + 3 a n a n + 1 2 a n 2 + 4 ( a n + 1 a n ) + a n = 0 n = 0 ( a n + 1 2 a n 2 ) + 4 n = 0 ( a n + 1 a n ) + n = 0 a n = 0 a 0 2 4 a 0 + S = 0 S = a 0 2 + 4 a 0 Note that a 0 = 1 = 5 \begin{aligned} a_{n+1}^2 + 4a_{n+1} & = a_n^2 + 3a_n \\ \implies a_{n+1}^2 - a_n^2+ 4\left(a_{n+1} - a_n\right) + a_n & = 0 \\ \sum_{n=0}^\infty \left(a_{n+1}^2 - a_n^2\right) + 4\sum_{n=0}^\infty \left(a_{n+1} - a_n\right) + \color{#3D99F6} \sum_{n=0}^\infty a_n & = 0 \\ - a_0^2 - 4a_0 + \color{#3D99F6} S & = 0 \\ \implies S & = {\color{#3D99F6}a_0}^2 + 4{\color{#3D99F6}a_0} & \small \color{#3D99F6} \text{Note that } a_0 = 1 \\ & = 5 \end{aligned}

100 S = 500 \implies \lfloor 100S \rfloor = \boxed{500}

Large nitpick: All elements of a sequence being strictly less than 1 does NOT imply that the limit of that sequence is strictly less than 1.

Daniel Juncos - 3 years, 9 months ago

Log in to reply

It is a n + 1 a n < 1 \left|\frac {a_{n+1}}{a_n} \right| < 1 not just a n < 1 a_n < 1 .

Chew-Seong Cheong - 3 years, 9 months ago

Log in to reply

a n + 1 a n < 1 \displaystyle{\left| \frac{a_{n+1}}{a_n} \right| < 1 } for all n 0 ̸ lim n a n + 1 a n < 1 \displaystyle{n \geq 0 \kern.6em\not\kern -.6em \implies \lim_{n \rightarrow \infty}\left|\frac{a_{n+1}}{a_n} \right| < 1} .

Let a n = 1 n \displaystyle{a_n = \frac{1}{n}} . Then a n + 1 a n = 1 n + 1 1 n = n n + 1 = n n + 1 < 1 \displaystyle{\left| \frac{a_{n+1}}{a_n} \right| = \left| \frac{\frac{1}{n+1}}{\frac{1}{n}} \right| =\left|\frac{n}{n+1} \right| = \frac{n}{n+1} < 1 } for all n 0 \displaystyle{n \geq 0} .

But lim n a n + 1 a n = lim n n n + 1 = 1 \displaystyle{\lim_{n \rightarrow \infty}\left| \frac{a_{n+1}}{a_n} \right| = \lim_{n \rightarrow \infty} \frac{n}{n+1} =1}

Daniel Juncos - 3 years, 9 months ago

Log in to reply

@Daniel Juncos But it is shown that 3 4 < a n + 1 a n < 1 \frac 34 < \frac {a_{n+1}}{a_n} < 1 , which means that a n + 1 a n \frac {a_{n+1}}{a_n} is bounded.

Chew-Seong Cheong - 3 years, 9 months ago

Log in to reply

@Chew-Seong Cheong Would you agree that 3 4 < n + 4 n + 5 < 1 \displaystyle{\frac{3}{4} < \frac{n+4}{n+5} < 1} for all n 0 \displaystyle{n \geq 0} ?

Daniel Juncos - 3 years, 9 months ago

Log in to reply

@Daniel Juncos Thanks, I get what you mean now. But how do I resolve my solution.

Chew-Seong Cheong - 3 years, 8 months ago

Log in to reply

@Chew-Seong Cheong You've already shown that a n a_{n} is positive and strictly decreasing. You can show that it converges to 0 0 and take take the limit as a n a_{n} approaches 0 0 in your expression for R R .

Brandon Monsen - 3 years, 8 months ago

Log in to reply

@Brandon Monsen This is correct. Then you can use this to show that a n + 1 a n \frac{a_{n+1}}{a_n} goes to 3 4 \frac{3}{4} .

Daniel Juncos - 3 years, 8 months ago

Log in to reply

@Daniel Juncos Thanks, I got it now.

Chew-Seong Cheong - 3 years, 8 months ago

Log in to reply

@Chew-Seong Cheong Closer, but still not exactly. Just because a sequence is bounded does not mean its limit exists. And just because a sequence is bounded below by 0 and is strictly decreasing does not mean its limit is zero.

Daniel Juncos - 3 years, 8 months ago

Log in to reply

@Daniel Juncos Thanks again. I have worded it as n n \to \infty , a n 2 a n + 1 2 a_n^2 \to a_{n+1}^2 . Not assuming that lim n 0 a n = 0 \displaystyle \lim_{n \to 0} a_n = 0 . If the limit is 0, then a n + 1 a n \dfrac {a_{n+1}}{a_n} is not defined.

Chew-Seong Cheong - 3 years, 8 months ago

Small nitpick: The ratio test is valid for R < 1 \left| R \right| < 1 , where R = a n + 1 a n R=\frac{a_{n+1}}{a_n} . It would be a good idea to give a lower bound for R R , since R = 3 R = -3 satisfies the condition you gave (that R < 1 R<1 ), but the series would diverge.

Brandon Monsen - 3 years, 9 months ago

Log in to reply

Thanks, you are right. I will change the solution.

Chew-Seong Cheong - 3 years, 9 months ago
Brandon Monsen
Sep 5, 2017

Relevant wiki: Telescoping Series - Sum

In the form given by the problem, we can see that if a n > 0 a_{n}>0 , then a n + 1 > 4 2 = 0 a n + 1 > 0 a_{n+1}>\sqrt{4}-2=0 \Rightarrow a_{n+1}>0 . Since a 0 > 0 a_{0}>0 , it follows that a n > 0 a_{n}>0 by induction on n n .

Now, rearrange the recurrence relation to get ( a n + 1 + 2 ) 2 = ( a n + 2 ) 2 a n \left( a_{n+1}+2 \right)^{2}= \left( a_{n}+2 \right)^{2} - a_{n} . In this form, it is easy to see that ( a n + 1 + 2 ) 2 < ( a n + 2 ) 2 (a_{n+1}+2)^{2}<(a_{n}+2)^{2} since a n > 0 a_{n}>0 . It follows that a n + 1 < a n a_{n+1}<a_{n}

We now know that a n a_{n} is a strictly decreasing sequence of positive reals, and so a n a_{n} must converge to some limit 0 L < a 0 0 \leq L < a_{0} . Thus, we have that ( L + 2 ) 2 = ( L + 2 ) 2 L L = 0 (L+2)^{2}=(L+2)^{2}-L \Rightarrow L=0

Rearrange again to get ( a n + 2 ) 2 ( a n + 1 + 2 ) 2 = a n (a_{n}+2)^{2}-(a_{n+1}+2)^{2}=a_{n} , and so S S can be written as a telescoping sum:

S = n = 0 a n = n = 0 [ ( a n + 2 ) 2 ( a n + 1 + 2 ) 2 ] = lim p ( a 0 + 2 ) 2 ( a p + 2 ) 2 = 5 S \ = \ \sum_{n=0}^{\infty} a_{n} \ = \ \sum_{n=0}^{\infty} [(a_{n}+2)^{2}-(a_{n+1}+2)^{2}] \ = \ \lim_{p \rightarrow \infty} (a_{0}+2)^{2} - (a_{p}+2)^{2} \ = \ 5

So 100 S = 500 \lfloor 100S \rfloor = \boxed{500}

Daniel Juncos
Sep 12, 2017

Relevant wiki: Convergence - Ratio Test

While the other solutions have arrived at the correct limit, I don't believe the mechanics behind either are entirely rigorous.

First, it can be easily shown through induction that a n > 0 , n N a_n>0, \forall n \in \mathbb{N} .

Then, 4 + 3 a n + a n 2 < 4 + 4 a n + a n 2 a n + 1 a n < 1 a n + 1 < a n \displaystyle{\sqrt{4+3a_n+{a_n}^2}<\sqrt{4+4a_n+{a_n}^2}\implies \frac{a_{n+1}}{a_n}<1\implies a_{n+1}<a_n} .

Since a n a_n is decreasing and bounded below, then there is some a 0 a\geq 0 such that a n a a_n \rightarrow a as n n \rightarrow \infty .

Now we can treat this limit algebraically. From a n + 1 = 4 + 3 a n + a n 2 2 \displaystyle{a_{n+1} = \sqrt{4+3a_n+{a_n}^2}-2} , send n n to infinity on both sides and we get

a = 4 + 3 a + a 2 2 4 a = 3 a a = 0 \displaystyle{a = \sqrt{4+3a+{a}^2}-2 \implies 4a=3a \implies a = 0} .

To see if a n \displaystyle{\sum a_n} converges, we can perform the ratio test:

a n + 1 a n = 4 + 3 a n + a n 2 2 a n 4 + 3 a n + a n 2 + 2 4 + 3 a n + a n 2 + 2 = 3 + a n 4 + 3 a n + a n 2 + 2 \displaystyle{\left|\frac{a_{n+1}}{a_n} \right| = \left|\frac{\sqrt{4+3a_n+{a_n}^2}-2}{a_n} \cdot \frac{\sqrt{4+3a_n+{a_n}^2}+2}{\sqrt{4+3a_n+{a_n}^2}+2}\right| = \left|\frac{3+a_n}{\sqrt{4+3a_n+{a_n}^2}+2} \right| } , since a n 0 a_n \neq 0 .

Since a n 0 a_n \rightarrow 0 , then lim n a n + 1 a n = 3 + 0 4 + 3 ( 0 ) + 0 2 + 2 = 3 4 \displaystyle{\lim_{n \rightarrow \infty}\left|\frac{a_{n+1}}{a_n} \right| = \left| \frac{3+0}{\sqrt{4+3(0)+0^2}+2} \right| = \frac{3}{4}} .

Since this limit is strictly less than 1 1 , then a n \displaystyle{\sum a_n} converges absolutely to some real number. We can now treat THAT limit algebraically as well.

Let A = a n \displaystyle{A = \sum a_n} . Then A 1 = a n + 1 \displaystyle{A -1 = \sum a_{n+1}} .

Since a n \displaystyle{\sum a_n} converges and all a n > 0 a_n > 0 , then there must be some N N such that for all n N n\geq N we have a n < 1 a_n <1 .

This means that for all n N n\geq N we have a n 2 < a n \displaystyle{{a_n}^2<a_n} ; i.e. a n 2 \displaystyle{\sum {a_n}^2} converges as well.

Let B = a n 2 \displaystyle{B = \sum {a_n}^2} . Then B 1 = a n + 1 2 \displaystyle{B -1 = \sum {a_{n+1}}^2} .

Finally, we have

a n + 1 = 4 + 3 a n + a n 2 2 a n + 1 2 + 4 a n + 1 = a n 2 + 3 a n a n + 1 2 + 4 a n + 1 = a n 2 + 3 a n B 1 + 4 ( A 1 ) = B + 3 A A = 5 \displaystyle{a_{n+1} = \sqrt{4+3a_n+{a_n}^2}-2 \implies {a_{n+1}}^2+4a_{n+1}= {a_{n}}^2+3a_{n} \implies \sum {a_{n+1}}^2+4\sum a_{n+1}= \sum {a_{n}}^2+3\sum a_{n} \implies B-1+4(A-1)= B+3A \implies A=5}

Good explanation

arjun rathod - 3 years, 9 months ago
Ahmed Moh AbuBakr
Sep 22, 2017

@Calvin Lin

Ahmed Moh AbuBakr - 3 years, 8 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...