Proof of Inequality X_n > sqrt(n) by Induction

  • Thread starter Thread starter acynicsmind
  • Start date Start date
  • Tags Tags
    Induction Proof
Click For Summary

Homework Help Overview

The problem involves proving that the sequence {X_n}, defined recursively, satisfies the inequality X_n > sqrt(n) for all n >= 2. The sequence starts with X_1 = 1 and follows the relation X_n+1 = X_n + 1/X_n for n > 1.

Discussion Character

  • Exploratory, Assumption checking, Mathematical reasoning

Approaches and Questions Raised

  • Participants discuss the initial verification of the inequality for small values of n and express confusion about how to proceed with the inductive step. Some suggest making assumptions about the inductive hypothesis and using the recursive definition of the sequence to derive the next step.

Discussion Status

The discussion is ongoing, with participants seeking clarification on how to apply the induction hypothesis and the recursive formula. There are multiple interpretations being explored regarding the use of the recursive relationship in the proof.

Contextual Notes

Participants note the challenge of applying induction to inequalities, which may differ from typical induction problems they have encountered. There is an emphasis on ensuring the correct application of the recursive formula in the proof process.

acynicsmind
Messages
2
Reaction score
0

Homework Statement



Show the sequence {X_n} defined by X_1 = 1, X_n+1 = X_n + 1/X_n for n > 1 obeys the inequality X_n > sqrt(n) for all n >= 2.

Homework Equations



The Attempt at a Solution



For n = 2, 2 > sqrt(2) and for n = 3, 2.5 > sqrt(2.5). So it holds so far. What to do here after initial step for the inductive step is confusing me. I've never seen an induction proof with an inequality before today and the ones I've looked at online are not helpful at all.

Any help is appreciated. Thank you.
 
Physics news on Phys.org
Well what I do in induction questions with inequalities, I just try to make up the formula for xN+1 after assuming true for n=N.

So I'd invert both sides and then go from there.
 
You haven't said exactly what you have done for the induction hypothesis and induction step, so here's what's left to do.
Assume that xk > \sqrt{k} is true.
Show that xk + 1 > \sqrt{k + 1}. Be sure to use the given information that xk + 1 = xk + 1/xk.
 
Mark44 said:
You haven't said exactly what you have done for the induction hypothesis and induction step, so here's what's left to do.
Assume that xk > \sqrt{k} is true.
Show that xk + 1 > \sqrt{k + 1}. Be sure to use the given information that xk + 1 = xk + 1/xk.

See, it's the recursive formula that is kind of tripping me up because I am not sure where to use it. Do I simply sub it in for Xk when trying to show xk + 1 > \sqrt{k + 1} and then work from there?
 
You know that xk + 1 = xk + 1/xk. Your induction hypothesis gives you something you can replace xk with.
 

Similar threads

Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
9
Views
2K
  • · Replies 15 ·
Replies
15
Views
3K