Proving the Convergence of (2n^2+n)/(n^2) to 2

  • Context: Undergrad 
  • Thread starter Thread starter jeff1evesque
  • Start date Start date
Click For Summary
SUMMARY

The discussion centers on proving the convergence of the sequence (2n^2+n)/(n^2) to 2 as n approaches infinity. A key step involves demonstrating that for n > 2, the inequality 2^n - n > n holds true. Participants suggest using mathematical induction and epsilon-delta definitions to formalize the proof. Simplifying the initial sequence is also emphasized as a critical step toward establishing convergence.

PREREQUISITES
  • Understanding of mathematical induction
  • Familiarity with epsilon-delta definitions in calculus
  • Knowledge of limits and convergence of sequences
  • Ability to manipulate algebraic expressions
NEXT STEPS
  • Learn how to apply mathematical induction in proofs
  • Study epsilon-delta definitions for formal proofs in calculus
  • Explore techniques for simplifying algebraic sequences
  • Investigate convergence criteria for sequences and series
USEFUL FOR

Mathematics students, educators, and anyone involved in formal proofs or sequence convergence analysis will benefit from this discussion.

jeff1evesque
Messages
312
Reaction score
0
I am trying to prove a larger problem, that the sequence (2n^2+n)/(n^2) --> 2

however, i need something small to prove it which is proving the fact that given n > 2,

2^n - n > n

THanks,


JL
 
Physics news on Phys.org
Try induction!
 
sutupidmath said:
Try induction!

Exactly what i was thinking, but i need it in a different form to fit my proof.

Proof:
Let e > 0 be given.
Let N = max{2, 1/n}
Note that, |1/(2^n - n) - 0| = |1/(2^n - n)| (trying to show later in the proof this is less than 1/n)

Assume n > N
then n > 2 (Goal: show that 1/(2^n - n) < (1/n) )
.
.
.
then since |xn - L| < 1/n
.
.
.
 
I need to show 2^n - n > n

But I need to start the proof with the assumption that n > 2.
 
jeff1evesque said:
I need to show 2^n - n > n

But I need to start the proof with the assumption that n > 2.

you can still use induction to prove it? What do you think prevents you from using induction here?
 
Svalbard said:
Contents of deleted post[/color]

he/she probbably needs to prove it using epsilond delta.(formal proof)
 
Last edited by a moderator:
sutupidmath said:
he/she probbably needs to prove it using epsilond delta.(formal proof)

Yeah that's it. Except i was just given sequence (2n^2+n)/(n^2) --> 2. And in my idea stage, I have the sequence equal to 1/(2^n - n) < 1/n.. and this is only true if n > 2.
 
jeff1evesque said:
Yeah that's it. Except i was just given sequence (2n^2+n)/(n^2) --> 2. And in my idea stage, I have the sequence equal to 1/(2^n - n) < 1/n.. and this is only true if n > 2.

you seem to be almost done. where is the problem here! it doesn't have to start with n=1 for you to apply induction, as a matter of fact induction holds even if you start at any k positive integer.
 
jeff1evesque said:
Yeah that's it. Except i was just given sequence (2n^2+n)/(n^2) --> 2. And in my idea stage, I have the sequence equal to 1/(2^n - n) < 1/n.. and this is only true if n > 2.


If your initial sequence involves only n^2, how do you arrive at a a statement that has 2^n involved?

As I read it, your initial sequence is

<br /> \frac{2n^2 + n}{n^2}<br />

If this is correct, just simplify the fraction that gives the nth term and you are 99% of the way to proving the sequence converges to 2. If it isn't correct, you have a typo in your original post on the form of the sequence.
 
Last edited:

Similar threads

  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 6 ·
Replies
6
Views
4K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 9 ·
Replies
9
Views
3K