64 685
Assignments Done
99,3%
Successfully Done
In September 2018

Answer to Question #22075 in Real Analysis for ekra

Question #22075
the recursive sequence is defined as, a1= 9, a2=6, an+1=√an-1+√an , n≥2. Show that the sequence is bounded and strictly decreasing. Find its limit.
Expert's answer

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

Assignment Expert
15.01.13, 18:37

You're welcome. We are glad to be helpful.
If you really liked our service please press like-button beside answer field. Thank you!

ekra
15.01.13, 18:28

thanks...GOD bless you...

Leave a comment

Ask Your question

Submit
Privacy policy Terms and Conditions