# To prove a sequence is Cauchy [duplicate]

I have a sequence: $a_{n}=\sqrt{3+ \sqrt{3 + ... \sqrt { 3} } }$ , it repeats $n$-times.

and i have to prove that it is a Cauchy's sequence. So i did this: As one theorem says that every convergent sequence is also Cauchy, so i proved that it's bounded between $\sqrt{3}$ and $3$ (with this one i am not sure, please check if i am right with this one.)And also i proved tat this sequence is monotonic. (with induction i proved this: $a_{n} \leq a_{n+1}$ so if it's bounded and monotonic, therefore it is convergent and Cauchy. I am just wondering if this already proved it or not? And also if the upper boundary - supremum if you wish - is chosen correctly. I appreciate all the help i get.

## marked as duplicate by Jonas Meyer, user147263, Claude Leibovici calculus StackExchange.ready(function() { if (StackExchange.options.isMobile) return; $('.dupe-hammer-message-hover:not(.hover-bound)').each(function() { var$hover = $(this).addClass('hover-bound'),$msg = $hover.siblings('.dupe-hammer-message');$hover.hover( function() { $hover.showInfoMessage('', { messageElement:$msg.clone().show(), transient: false, position: { my: 'bottom left', at: 'top center', offsetTop: -7 }, dismissable: false, relativeToBody: true }); }, function() { StackExchange.helpers.removeMessages(); } ); }); }); Jul 5 '15 at 4:07

• how do you prove that $3$ is an upper bound ? – Surb Jun 25 '15 at 9:42
• @surb 3 is not the upper bound as pointed out in Nemo's answer its about 2.303 which is less than 3 so its bounded below 3. – Warren Hill Jun 25 '15 at 10:18
• I know that it wasn't the most accurate number,but i did not have any problem without being totally specific, so it still works for 3. If it's bounded by 2.303, then 3 is also an upper value...it still proves boundance,although more accurate would be better, but it isn't much of a problem here. – MathIsTheWayOfLife Jun 25 '15 at 10:24
• 3 is not the least upper bound, but it is an upper bound and therefore works just fine. – Klaus Draeger Jun 25 '15 at 11:10
• Yeah, if it wouldn't I would just use another one. – MathIsTheWayOfLife Jun 25 '15 at 11:13

${ a }_{ n+1 }=\sqrt { a_{ n }+3 }$ $\Rightarrow \quad { a^{ 2 } }_{ n+1 }=a_{ n }+3$ as $n\rightarrow \infty$ $\Rightarrow \quad { a^{ 2 } }_{ n+1 }=a_{ n }+3$ $\quad x^{ 2 }=x+3\quad \Rightarrow$ $x^{ 2 }-x-3=0$ $and\quad it\quad$ convergents to the $x=\frac { 1+\sqrt { 13 } }{ 2 }$

• I don't need to calculate limit,but thank you. – MathIsTheWayOfLife Jun 25 '15 at 10:20
• This doesn't prove convergence. It derives the limit under the condition it converges. – man and laptop Jun 25 '15 at 10:32

Yes, correct ideas.

For boundedness, you can use induction:

1. $\sqrt 3<3$, good.
2. Suppose $a_n<3$ then $a_{n+1}=\sqrt{3+a_n}<\sqrt{3+3}=\sqrt6<3$.

Once you have boundedness, you can also show the Cauchy property directly. Note that (for nonnegative $u,v$)

$|\sqrt{3+u}-\sqrt{3+v}| = \frac{|u-v|}{\sqrt{3+u}+\sqrt{3+v}} \le \frac{|u-v|}{2\sqrt{3}}$.

So starting from $|a_0-a_n|\le 3-\sqrt{3}$, you get $|a_i-a_j|\le\frac{3-\sqrt{3}}{(2\sqrt{3})^N}$ for all $i,j\ge N$.

• This works too, but the first thing popped in my head was that convergence and Cauchy equiualence theorem. – MathIsTheWayOfLife Jun 25 '15 at 11:32