Help in proving sequence by induction

In summary, the conversation discusses the sequence u_1, u_2, u_3,... defined by u_1=1 and u_{n+1}=-1+{\sqrt{u_n+7}} and explores how to prove that u_n<2 for all n\geq1 by induction. The conversation also discusses how to show that if u_n=2-\epsilon, where \epsilon is small, then u_{n+1}\approx 2-\frac{1}{6}\epsilon by using the Taylor series expansion.
  • #1
rock.freak667
Homework Helper
6,223
31

Homework Statement


The sequence [tex]u_1,u_2,u_3,...[/tex] is such that [tex]u_1=1[/tex] and [tex]u_{n+1}=-1+{\sqrt{u_n+7}}[/tex]

a) Prove by induction that [tex]u_n<2 for all n\geq1[/tex]
b) show that if [tex]u_n=2-\epsilon[/tex], where [tex]\epsilon[/tex] is small, then [tex]u_{n+1}\approx 2-\frac{1}{6}\epsilon[/tex]



Homework Equations



The Attempt at a Solution


[tex]u_{n+1}=-1+sqrt{u_n+7}[/tex]

[tex]\Rightarrow u_n=(u_{n+1}+1)^2-7[/tex]

Assume statement is true for all [tex]k\geq1[/tex]
then [tex]u_k<2[/tex]
[tex]\Rightarrow (u_{k+1}+1)^2-7<2[/tex]


[tex] (u_{k+1}+1)^2-(3)^2<0[/tex]

[tex]((u_{k+1}+1)-3)((u_{k+1}+1)-3)<0[/tex]

[tex](u_{k+1}+1)-3>0[/tex] AND [tex](u_{k+1}+1)-3<0[/tex]
[tex]
u_{k+1}+1>3

u_{k+1}>2
[/tex]

Thus [tex]u_{n+1}>2[/tex] is true

[tex]
(u_{k+1}+1)-3<0

u_{k+1}+1<-3

u_{k+1}<-2
[/tex]
does this affect anything in my proof?

I didn't bother to substitute the values of [tex]u_1[/tex] and [tex]u_2[/tex] and so forth as i have already done it and it is so for all [tex]n\geq1[/tex]

but I do not know how to do part b)
 
Last edited by a moderator:
Physics news on Phys.org
  • #2
rock.freak667 said:

Homework Statement


The sequence [tex]u_1,u_2,u_3,...[/tex] is such that [tex]u_1=1[/tex] and [tex]u_{n+1}=-1+{\sqrt{u_n+7}}[/tex]

a) Prove by induction that [tex]u_n<2 for all n\geq1[/tex]
b) show that if [tex]u_n=2-\epsilon[/tex], where [tex]\epsilon[/tex] is small, then [tex]u_{n+1}\approx 2-\frac{1}{6}\epsilon



Homework Equations



The Attempt at a Solution


[tex]u_{n+1}=-1+sqrt{u_n+7}[/tex]

[tex]\Rightarrow u_n=(u_{n+1}+1)^2-7[/tex]

Assume statement is true for all [tex]k\geq1[/tex]

Didn't you mean assume it's true for [tex]n\leq{k}[/tex] ? Actually assuming it is true for n=k is sufficient. But either way is fine.

then [tex]u_k<2[/tex]
[tex]\Rightarrow (u_{k+1}+1)^2-7<2[/tex]


[tex] (u_{k+1}+1)^2-(3)^2<0[/tex]

Good so far... but at this point I'd take the 3^2 to the other side... if x^2<a^2 where a>0, then x<a and x>-a... and then you can use the x<a part to finish...
 
  • #3
For part b, use the taylor series expansion in terms of [tex]\epsilon[/tex]... you only need the first two terms.
 
  • #4
So then expand [tex]\sqrt{u_n+7}[/tex] using taylor series and it should work out then?
 
  • #5
rock.freak667 said:
So then expand [tex]\sqrt{u_n+7}[/tex] using taylor series and it should work out then?

You should substitute in [tex]2-\epsilon[/tex] for [tex]u_n[/tex] in the expression for [tex]u_{n+1}[/tex]... then get the taylor series of [tex]u_{n+1}[/tex] in terms of epsilon...
 

FAQ: Help in proving sequence by induction

What is the purpose of using induction in proving a sequence?

The purpose of using induction in proving a sequence is to prove that a statement or property holds for all elements in the sequence. This is done by showing that the statement holds for the first element in the sequence, and then assuming it holds for any arbitrary element, known as the induction hypothesis. By showing that the statement holds for the next element in the sequence, known as the inductive step, we can conclude that the statement holds for all elements in the sequence.

How do you come up with the base case in a proof by induction?

The base case in a proof by induction is the first element in the sequence that we are trying to prove the statement for. It is typically the simplest element in the sequence, such as 0 or 1, and serves as the starting point for the proof. To come up with the base case, we need to carefully examine the sequence and determine which element would be the most suitable to use as the base case.

What is the difference between strong and weak induction?

Strong induction, also known as complete induction, is a more powerful form of induction that allows us to assume that the statement holds for all previous elements in the sequence, rather than just the immediately preceding element. In contrast, weak induction only allows us to assume that the statement holds for the immediately preceding element. Strong induction is used when the inductive step requires knowledge of more than just the previous element, while weak induction is used when the inductive step only requires knowledge of the previous element.

Can induction be used to prove any statement?

No, induction can only be used to prove statements that have a defined sequence. It cannot be used to prove statements about continuous or uncountable sets. Additionally, the statement being proved must be one that can be generalized to all elements in the sequence, and the base case must be well-defined. If these conditions are not met, induction cannot be used to prove the statement.

What are some common mistakes to avoid when using induction in a proof?

One common mistake in using induction is assuming that the statement holds for all elements in the sequence without properly proving it for the base case or inductive step. It is important to ensure that all necessary steps are taken to prove the statement for all elements. Another mistake is using the wrong form of induction, such as trying to use weak induction when the inductive step requires knowledge of more than just the previous element. It is also important to carefully examine the sequence and ensure that it follows a clear pattern before attempting to use induction to prove a statement about it.

Similar threads

Replies
24
Views
3K
Replies
4
Views
2K
Replies
11
Views
870
Replies
9
Views
958
Replies
11
Views
1K
Replies
1
Views
2K
Back
Top