Proving $a_{0} = 1$, $a_{n + 1} = sqrt{1 + a_{n}}$ converges to the golden ratio [duplicate]
This question already has an answer here:
Prove that the limit of this sequence is $frac{1}{2}(1 + sqrt{5})$
4 answers
Define $a_{0} = 1$ and $a_{n + 1} = sqrt{1 + a_{0}}$.
Then we have
$$lim_{ntoinfty} a_{n} = sqrt{1 + sqrt{1 + sqrt{1 + sqrt{1 + ldots }}}} $$
So I let $x = sqrt{1 + sqrt{ 1 + ldots }}$. Then we have
$$x = sqrt{1 + x} Longleftrightarrow x = frac{1 pm sqrt{5}}{2}.$$
So I think it converges to the golden ratio. But how can I prove this? Clearly, it's monotone increasing. Now I can just show the golden ratio is a supremum for the sequence. But how can I do that? (Monotone Convergence Theorem)
sequences-and-series convergence
marked as duplicate by Martin R, man on laptop, Davide Giraudo, KReiser, Shailesh Nov 28 '18 at 0:53
This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.
add a comment |
This question already has an answer here:
Prove that the limit of this sequence is $frac{1}{2}(1 + sqrt{5})$
4 answers
Define $a_{0} = 1$ and $a_{n + 1} = sqrt{1 + a_{0}}$.
Then we have
$$lim_{ntoinfty} a_{n} = sqrt{1 + sqrt{1 + sqrt{1 + sqrt{1 + ldots }}}} $$
So I let $x = sqrt{1 + sqrt{ 1 + ldots }}$. Then we have
$$x = sqrt{1 + x} Longleftrightarrow x = frac{1 pm sqrt{5}}{2}.$$
So I think it converges to the golden ratio. But how can I prove this? Clearly, it's monotone increasing. Now I can just show the golden ratio is a supremum for the sequence. But how can I do that? (Monotone Convergence Theorem)
sequences-and-series convergence
marked as duplicate by Martin R, man on laptop, Davide Giraudo, KReiser, Shailesh Nov 28 '18 at 0:53
This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.
Also: math.stackexchange.com/q/115501/42969.
– Martin R
Nov 27 '18 at 18:17
It is of the form $a_{n+1}=f(a_n)$ with $f$ differentiable such that $|f'(varphi)|<1$; as such it is a consequence of (one of) the fixed point theorem(s).
– Jean Marie
Nov 27 '18 at 18:32
add a comment |
This question already has an answer here:
Prove that the limit of this sequence is $frac{1}{2}(1 + sqrt{5})$
4 answers
Define $a_{0} = 1$ and $a_{n + 1} = sqrt{1 + a_{0}}$.
Then we have
$$lim_{ntoinfty} a_{n} = sqrt{1 + sqrt{1 + sqrt{1 + sqrt{1 + ldots }}}} $$
So I let $x = sqrt{1 + sqrt{ 1 + ldots }}$. Then we have
$$x = sqrt{1 + x} Longleftrightarrow x = frac{1 pm sqrt{5}}{2}.$$
So I think it converges to the golden ratio. But how can I prove this? Clearly, it's monotone increasing. Now I can just show the golden ratio is a supremum for the sequence. But how can I do that? (Monotone Convergence Theorem)
sequences-and-series convergence
This question already has an answer here:
Prove that the limit of this sequence is $frac{1}{2}(1 + sqrt{5})$
4 answers
Define $a_{0} = 1$ and $a_{n + 1} = sqrt{1 + a_{0}}$.
Then we have
$$lim_{ntoinfty} a_{n} = sqrt{1 + sqrt{1 + sqrt{1 + sqrt{1 + ldots }}}} $$
So I let $x = sqrt{1 + sqrt{ 1 + ldots }}$. Then we have
$$x = sqrt{1 + x} Longleftrightarrow x = frac{1 pm sqrt{5}}{2}.$$
So I think it converges to the golden ratio. But how can I prove this? Clearly, it's monotone increasing. Now I can just show the golden ratio is a supremum for the sequence. But how can I do that? (Monotone Convergence Theorem)
This question already has an answer here:
Prove that the limit of this sequence is $frac{1}{2}(1 + sqrt{5})$
4 answers
sequences-and-series convergence
sequences-and-series convergence
asked Nov 27 '18 at 18:10
stackofhay42
1696
1696
marked as duplicate by Martin R, man on laptop, Davide Giraudo, KReiser, Shailesh Nov 28 '18 at 0:53
This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.
marked as duplicate by Martin R, man on laptop, Davide Giraudo, KReiser, Shailesh Nov 28 '18 at 0:53
This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.
Also: math.stackexchange.com/q/115501/42969.
– Martin R
Nov 27 '18 at 18:17
It is of the form $a_{n+1}=f(a_n)$ with $f$ differentiable such that $|f'(varphi)|<1$; as such it is a consequence of (one of) the fixed point theorem(s).
– Jean Marie
Nov 27 '18 at 18:32
add a comment |
Also: math.stackexchange.com/q/115501/42969.
– Martin R
Nov 27 '18 at 18:17
It is of the form $a_{n+1}=f(a_n)$ with $f$ differentiable such that $|f'(varphi)|<1$; as such it is a consequence of (one of) the fixed point theorem(s).
– Jean Marie
Nov 27 '18 at 18:32
Also: math.stackexchange.com/q/115501/42969.
– Martin R
Nov 27 '18 at 18:17
Also: math.stackexchange.com/q/115501/42969.
– Martin R
Nov 27 '18 at 18:17
It is of the form $a_{n+1}=f(a_n)$ with $f$ differentiable such that $|f'(varphi)|<1$; as such it is a consequence of (one of) the fixed point theorem(s).
– Jean Marie
Nov 27 '18 at 18:32
It is of the form $a_{n+1}=f(a_n)$ with $f$ differentiable such that $|f'(varphi)|<1$; as such it is a consequence of (one of) the fixed point theorem(s).
– Jean Marie
Nov 27 '18 at 18:32
add a comment |
3 Answers
3
active
oldest
votes
You already know the sequence is increasing. In order to use the monotone convergence theorem, you need to show it's bounded as well. If $a_n < 2$ for some $n$, then
$$a_{n + 1}^2 = 1 + a_n < 3 < 4 implies a_{n + 1} < 2$$
since the terms are positive. Hence, the sequence is bounded and convergent.
Now since $a_{n + 1} = sqrt{1 + a_n}$, it is valid to take a limit on both sides and find that the limit $L$ satisfies $L = sqrt{1 + L}$, and you're pretty close to being done.
@Masacroso Thanks!
– T. Bongers
Nov 27 '18 at 18:45
add a comment |
Define $$a_n=b_n+phi$$where $phi $ is the famous Golden Ratio. Therefore $$a_{n+1}=b_{n+1}+phi=sqrt{1+a_n}=sqrt{b_n+phi +1}$$where the third equality comes from the definition of $phi$. This yields to $$b_{n+1}=sqrt{b_n+phi +1}-phi ={b_n+phi +1-phi ^2over phi +sqrt{b_n+phi +1}}={b_nover phi +sqrt{b_n+phi +1}}$$therefore $$|b_{n+1}|le {|b_n|over phi}$$which means that $b_nto 0$ and $a_nto phi$
add a comment |
In this answer,
Question on sequences and induction,
I showed that if
$a_{n+1} = sqrt{a_n+k}$
where
$k > 0$
then
$lim_{n to infty} a_n
= d+1$
where
$d^2+d = k$,
so
$d = dfrac{sqrt{4k+1}-1}{2}$
and
$d+1 = dfrac{sqrt{4k+1}+1}{2}$.
When $k = 1$,
$d+1 = dfrac{sqrt{5}+1}{2}$.
add a comment |
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
You already know the sequence is increasing. In order to use the monotone convergence theorem, you need to show it's bounded as well. If $a_n < 2$ for some $n$, then
$$a_{n + 1}^2 = 1 + a_n < 3 < 4 implies a_{n + 1} < 2$$
since the terms are positive. Hence, the sequence is bounded and convergent.
Now since $a_{n + 1} = sqrt{1 + a_n}$, it is valid to take a limit on both sides and find that the limit $L$ satisfies $L = sqrt{1 + L}$, and you're pretty close to being done.
@Masacroso Thanks!
– T. Bongers
Nov 27 '18 at 18:45
add a comment |
You already know the sequence is increasing. In order to use the monotone convergence theorem, you need to show it's bounded as well. If $a_n < 2$ for some $n$, then
$$a_{n + 1}^2 = 1 + a_n < 3 < 4 implies a_{n + 1} < 2$$
since the terms are positive. Hence, the sequence is bounded and convergent.
Now since $a_{n + 1} = sqrt{1 + a_n}$, it is valid to take a limit on both sides and find that the limit $L$ satisfies $L = sqrt{1 + L}$, and you're pretty close to being done.
@Masacroso Thanks!
– T. Bongers
Nov 27 '18 at 18:45
add a comment |
You already know the sequence is increasing. In order to use the monotone convergence theorem, you need to show it's bounded as well. If $a_n < 2$ for some $n$, then
$$a_{n + 1}^2 = 1 + a_n < 3 < 4 implies a_{n + 1} < 2$$
since the terms are positive. Hence, the sequence is bounded and convergent.
Now since $a_{n + 1} = sqrt{1 + a_n}$, it is valid to take a limit on both sides and find that the limit $L$ satisfies $L = sqrt{1 + L}$, and you're pretty close to being done.
You already know the sequence is increasing. In order to use the monotone convergence theorem, you need to show it's bounded as well. If $a_n < 2$ for some $n$, then
$$a_{n + 1}^2 = 1 + a_n < 3 < 4 implies a_{n + 1} < 2$$
since the terms are positive. Hence, the sequence is bounded and convergent.
Now since $a_{n + 1} = sqrt{1 + a_n}$, it is valid to take a limit on both sides and find that the limit $L$ satisfies $L = sqrt{1 + L}$, and you're pretty close to being done.
edited Nov 27 '18 at 18:45
answered Nov 27 '18 at 18:13
T. Bongers
22.8k54661
22.8k54661
@Masacroso Thanks!
– T. Bongers
Nov 27 '18 at 18:45
add a comment |
@Masacroso Thanks!
– T. Bongers
Nov 27 '18 at 18:45
@Masacroso Thanks!
– T. Bongers
Nov 27 '18 at 18:45
@Masacroso Thanks!
– T. Bongers
Nov 27 '18 at 18:45
add a comment |
Define $$a_n=b_n+phi$$where $phi $ is the famous Golden Ratio. Therefore $$a_{n+1}=b_{n+1}+phi=sqrt{1+a_n}=sqrt{b_n+phi +1}$$where the third equality comes from the definition of $phi$. This yields to $$b_{n+1}=sqrt{b_n+phi +1}-phi ={b_n+phi +1-phi ^2over phi +sqrt{b_n+phi +1}}={b_nover phi +sqrt{b_n+phi +1}}$$therefore $$|b_{n+1}|le {|b_n|over phi}$$which means that $b_nto 0$ and $a_nto phi$
add a comment |
Define $$a_n=b_n+phi$$where $phi $ is the famous Golden Ratio. Therefore $$a_{n+1}=b_{n+1}+phi=sqrt{1+a_n}=sqrt{b_n+phi +1}$$where the third equality comes from the definition of $phi$. This yields to $$b_{n+1}=sqrt{b_n+phi +1}-phi ={b_n+phi +1-phi ^2over phi +sqrt{b_n+phi +1}}={b_nover phi +sqrt{b_n+phi +1}}$$therefore $$|b_{n+1}|le {|b_n|over phi}$$which means that $b_nto 0$ and $a_nto phi$
add a comment |
Define $$a_n=b_n+phi$$where $phi $ is the famous Golden Ratio. Therefore $$a_{n+1}=b_{n+1}+phi=sqrt{1+a_n}=sqrt{b_n+phi +1}$$where the third equality comes from the definition of $phi$. This yields to $$b_{n+1}=sqrt{b_n+phi +1}-phi ={b_n+phi +1-phi ^2over phi +sqrt{b_n+phi +1}}={b_nover phi +sqrt{b_n+phi +1}}$$therefore $$|b_{n+1}|le {|b_n|over phi}$$which means that $b_nto 0$ and $a_nto phi$
Define $$a_n=b_n+phi$$where $phi $ is the famous Golden Ratio. Therefore $$a_{n+1}=b_{n+1}+phi=sqrt{1+a_n}=sqrt{b_n+phi +1}$$where the third equality comes from the definition of $phi$. This yields to $$b_{n+1}=sqrt{b_n+phi +1}-phi ={b_n+phi +1-phi ^2over phi +sqrt{b_n+phi +1}}={b_nover phi +sqrt{b_n+phi +1}}$$therefore $$|b_{n+1}|le {|b_n|over phi}$$which means that $b_nto 0$ and $a_nto phi$
answered Nov 27 '18 at 18:18
Mostafa Ayaz
13.6k3836
13.6k3836
add a comment |
add a comment |
In this answer,
Question on sequences and induction,
I showed that if
$a_{n+1} = sqrt{a_n+k}$
where
$k > 0$
then
$lim_{n to infty} a_n
= d+1$
where
$d^2+d = k$,
so
$d = dfrac{sqrt{4k+1}-1}{2}$
and
$d+1 = dfrac{sqrt{4k+1}+1}{2}$.
When $k = 1$,
$d+1 = dfrac{sqrt{5}+1}{2}$.
add a comment |
In this answer,
Question on sequences and induction,
I showed that if
$a_{n+1} = sqrt{a_n+k}$
where
$k > 0$
then
$lim_{n to infty} a_n
= d+1$
where
$d^2+d = k$,
so
$d = dfrac{sqrt{4k+1}-1}{2}$
and
$d+1 = dfrac{sqrt{4k+1}+1}{2}$.
When $k = 1$,
$d+1 = dfrac{sqrt{5}+1}{2}$.
add a comment |
In this answer,
Question on sequences and induction,
I showed that if
$a_{n+1} = sqrt{a_n+k}$
where
$k > 0$
then
$lim_{n to infty} a_n
= d+1$
where
$d^2+d = k$,
so
$d = dfrac{sqrt{4k+1}-1}{2}$
and
$d+1 = dfrac{sqrt{4k+1}+1}{2}$.
When $k = 1$,
$d+1 = dfrac{sqrt{5}+1}{2}$.
In this answer,
Question on sequences and induction,
I showed that if
$a_{n+1} = sqrt{a_n+k}$
where
$k > 0$
then
$lim_{n to infty} a_n
= d+1$
where
$d^2+d = k$,
so
$d = dfrac{sqrt{4k+1}-1}{2}$
and
$d+1 = dfrac{sqrt{4k+1}+1}{2}$.
When $k = 1$,
$d+1 = dfrac{sqrt{5}+1}{2}$.
answered Nov 27 '18 at 18:48
marty cohen
72.5k549127
72.5k549127
add a comment |
add a comment |
Also: math.stackexchange.com/q/115501/42969.
– Martin R
Nov 27 '18 at 18:17
It is of the form $a_{n+1}=f(a_n)$ with $f$ differentiable such that $|f'(varphi)|<1$; as such it is a consequence of (one of) the fixed point theorem(s).
– Jean Marie
Nov 27 '18 at 18:32