Let $a_1=2$ and we define $a_{n+1}=a_n+\sqrt {a_n},n\geq 1$.
Is it possible to get a good aproximation of the $n$th term $a_n$?
The first terms are $2,2+\sqrt{2}$, $2+\sqrt{2}+\sqrt{2+\sqrt{2}}$ ...
Thanks in advance!
- 83,877
- 9,271
- 4
- 32
- 47
-
Please take at least a day or two before accepting an answer. In this case, the accepted answer is incomplete. – Aryabhata Mar 19 '15 at 15:10
-
1I followed your advice.Thanks for the support. – Konstantinos Gaitanas Mar 19 '15 at 15:35
4 Answers
Here is a method to develop the asymptotic behaviour of $a_n$ with a precision of two terms.
First, simply remark that $a_n$ grows to infinity since $a_n \geq n$ (by induction).
Then remark that $\sqrt{a_{n+1}} - \sqrt{a_n} = \frac{a_{n+1}-a_{n}}{\sqrt{a_{n+1}} + \sqrt{a_n}} = \frac{1}{1+\sqrt{1+\sqrt{\frac{1}{a_n}}}} \rightarrow \frac{1}{2}$ since $a_n\rightarrow\infty$.
It follows that $\sqrt{a_n} - 2=\sum_{i=0}^{n-1}\sqrt{a_{i+1}} - \sqrt{a_i}=\frac{1}{2}n+\mathcal{o}(n)$, then $a_n=(\frac{n}{2}+\mathcal{o}(n))^2 = \frac{n^2}{4}+\mathcal{o}(n^2)$
For the next term, we plug the asymptotic development we have just obtained into $\frac{1}{1+\sqrt{1+\sqrt{\frac{1}{a_n}}}}$ and look for an equivalent of $\frac{1}{1+\sqrt{1+\frac{1}{\sqrt{\frac{n^2}{4}+\mathcal{o}(n^2)}}}}-\frac{1}{2} \sim \frac{1-\sqrt{1+\frac{1}{\sqrt{\frac{n^2}{4}+\mathcal{o}(n^2)}}}}{4} \sim \frac{1}{4}\frac{1}{2}\frac{1}{\sqrt{\frac{n^2}{4}+\mathcal{o}(n^2)}} \sim \frac{1}{4n}$
From this, we deduce $\sqrt{a_{n+1}} - \sqrt{a_n} = \frac{1}{2}-\frac{1}{4n}+\mathcal{o}(\frac{1}{n})$, then $\sqrt{a_n} = \frac{n}{2}-\frac{1}{4}S_n + \mathcal{o}(S_n)$ where $S_n=\sum_0^n\frac{1}{k}=\ln(n)+\mathcal{o}(\ln(n))$.
It follows that $a_n=(\frac{n}{2}-\frac{1}{4}\ln(n)+\mathcal{o}(\ln(n)))^2=\frac{n^2}{4}-\frac{n\ln(n)}{4}+ \mathcal{o}(n\ln(n))$.
I believe that plugging again this new asymptotic development into the first formula would produce subsequent terms.
- 36,640
- 281
-
How did you determine that the error on \sqrt{a_n}-2 was o(n)? the (1/2)n term makes sense, but why o(n) specifically? Also, is it intended that the error be little o or did you mean big O? Thanks in advance. – person Aug 25 '22 at 23:23
-
Isn't there a sign error here?
$$\frac{1}{1+\sqrt{1+\frac{1}{\sqrt{\frac{n^2}{4}+\mathcal{o}(n^2)}}}}-\frac{1}{2} \sim -\frac{1}{4n}$$
– TheDoctor Dec 18 '23 at 04:56
Yes, the approximation is $$a_n\sim \frac{n^2}{4}+o\left(n^2\right).$$ An heuristic derivation that should be possible to make rigorous is just replace $a_n$ by a smooth function $a(n)$. Then the recurrence relation gives a differential equation for $a(n)$: $$a_{n+1}-a_n\to a'(n)=\sqrt{a(n)}\quad \Longrightarrow \quad a(n)=\frac{(n+C)^2}{4}.$$
- 54,260
-
-
-
To be an complement to O.L.'s answer. Define a function $a(x)$ satisfies $a(n) = a_n$, and $a'(n) = a_{n+1}-a_n$. Actually, there are many choices for $a(x)$ by drawing a graph. – laboon Mar 19 '15 at 14:22
-
I do not get it.How did you arrive at the differential equation?I tried to differntiate but without much success.Could you be more specific please? – Konstantinos Gaitanas Mar 19 '15 at 14:36
-
-
2The heuristic is only a first step. Making it rigorous is the hard part. -1 till there is a proof. Sorry. – Aryabhata Mar 19 '15 at 15:05
-
@Aryabhata My intention was to show only how to make the first step so that the people enjoying $\epsilon-\delta$ and Stolz-Cesaro could do the rest. For me this is not interesting, sorry. – Start wearing purple Mar 19 '15 at 15:16
-
3This is not pedantry. I don't think this is as trivial as you seem to be implying. Unless you have a proof, you are just handwaving. Anyway, you are free not to elaborate, and I am free to leave the downvote intact. – Aryabhata Mar 19 '15 at 15:20
-
For the third term, we have the following. Let $c_n = \sqrt{a_n} -\frac{1}{2}n + \frac{1}{4}\ln n$, then $c_{n+1} -c_{n} = -\frac{1}{2} \cdot \frac{\sqrt{a_n}}{(\sqrt{a_n}+\sqrt{\sqrt{a_n}+a_n})^2} + \frac{1}{4} \ln(1+ \frac{1}{n})\quad (1)$. Note that $a_n = \frac{1}{4}n^2 - \frac{1}{4}n\ln n + o(n \ln n)$, the first term in R.H.S of (1) equals to $-\frac{1}{8} \cdot \frac{2n - \ln n + o(\ln n)}{n^2 -n \ln n + o(n \ln n)} = -\frac{1}{8n} \cdot(2+ \frac{ \ln n + o(\ln n)}{n - \ln n + o( \ln n)} )= -\frac{1}{4n} - \frac{\ln n}{8n^2}(1+o(1))$. Therefore (1) $= - \frac{\ln n}{8n^2}(1+o(1))$. Then we have $\lim_{n \rightarrow \infty} \frac{c_{n+1} -c_{n} }{- \frac{\ln n}{8n^2}} = 1$ and also have $\lim_{n \rightarrow \infty} \frac{c_{n+1} -c_{n} }{ \frac{\ln (n+1)+1}{8(n+1)} -\frac{\ln n+1}{8n} } = 1$. For $\frac{\ln n+1}{8n}$, we may integrate $-\frac{\ln x}{8x^2}$ with respect to $x$.
- 251
Here is one method using an Ansatz as in my answer to MSE question 506723.
Define (where $\,C\,$ depends on $\,a_1$ and, in this case, $C \approx 4.700709769834228559253142500$) $$ a_1 = 2,\qquad a_{n+1} = a_n + \sqrt {a_n},\qquad x := 1/n, \qquad y := C + \log(1/n). \tag1 $$
Numerical computations suggest the Ansatz $$ a_n = f(n) := \frac{n^2}4 + c_1 n + c_2 + c_3 x + c_4 x^2 + O(x^3) \tag2 $$
where $$ c_1 = \frac{y}4,\;\; c_2 = \frac{-2y+y^2}{16},\;\; c_3 = \frac{-1+6y-3y^2}{96},\;\; c_4 = \frac{7-15y+3y^3}{576}. \tag3 $$
This can be verified by computing $\,a_n+\sqrt{a_n}\,$ and comparing this to $\,a_{n+1}\,$ which comes from equations $(2)$ and $(3)$ with $\,n\,$ replaced with $\,n+1.\,$
A less precise approximation is (N.B. $\log(1/n)=-\log(n)$)
$$ a_n = \frac{n^2}4 - \frac{n}4\log(n) + O(\log(n)^2). \tag 4 $$
As a check here is a small table of sequence and function values:
$$ \begin{array}{|r|r|r|} \hline n & a_n & f(n) \\ \hline 1 & 2.00000000000 & 2.24221569682 \\ \hline 2 & 3.41421356237 & 3.43645680198 \\ \hline 4 & 7.55587162853 & 7.55727556720 \\ \hline 8 & 21.3371989182 & 21.3372439376 \\ \hline 16 & 71.7034402305 & 71.7034390455 \\ \hline 32 & 265.821329043 & 265.821328895 \\ \hline 64 & 1032.62006989 & 1032.62006990 \\ \hline \end{array}$$
- 37,457
- 3
- 35
- 85