Proving S2n-Sn is greater than a half in terms of the harmonic series

Click For Summary
SUMMARY

The discussion centers on proving that |S2n - Sn| ≥ 1/2 for the harmonic series, where Sn = 1 + 1/2 + 1/3 + ... + 1/n. The proof utilizes mathematical induction, starting with the base case of n=1, which confirms the inequality holds. The inductive step involves showing that |S2m+2 - Sm+1| maintains the inequality through established relationships between the sums. An alternative approach suggests directly calculating the difference between S2n and Sn, demonstrating that the inequality is satisfied without induction.

PREREQUISITES
  • Understanding of harmonic series and its properties
  • Familiarity with mathematical induction
  • Basic knowledge of inequalities in mathematics
  • Ability to manipulate series and sequences
NEXT STEPS
  • Study the properties of harmonic series in greater depth
  • Learn advanced techniques in mathematical induction
  • Explore inequalities and their applications in proofs
  • Investigate alternative proof methods for series convergence
USEFUL FOR

Students studying mathematics, particularly those focusing on series, sequences, and proof techniques. This discussion is beneficial for anyone looking to strengthen their understanding of harmonic series and mathematical induction.

gottfried
Messages
118
Reaction score
0

Homework Statement


Let Sn = 1+\frac{1}{2}+\frac{1}{3}+\frac{1}{4}...+\frac{1}{n}. Show that |S2n-Sn|\geq \frac{1}{2}


Homework Equations





The Attempt at a Solution



So I'm going to try and use induction

Base case let n=1

|S2n-Sn| = \frac{1}{2}

So true for base case

Assume true for case that n=m

So if n=m+1

|S2m+2-Sm+1|= |S2m+2-S2m+S2m-Sm+1|

Our induction assumption tells us that |S2m-S2m+2|\geq \frac{1}{2} and S2m+2-S2m = \frac{1}{2m+1}+\frac{1}{2m+2}> 0

Therefore |S2m+2-Sm|= |S2m+2-S2m+S2m-S2m+2|> \frac{1}{2}

Have I used induction properly? Since I haven't used the base case at all the proof feels a little like I've made the assumption that it is true and then shown that it is true but at the same time I feel like I haven't broken any of the rules of induction. I'm I wrong?
 
Physics news on Phys.org
gottfried said:

Homework Statement


Let Sn = 1+\frac{1}{2}+\frac{1}{3}+\frac{1}{4}...+\frac{1}{n}. Show that |S2n-Sn|\geq \frac{1}{2}


Homework Equations





The Attempt at a Solution



So I'm going to try and use induction

Base case let n=1

|S2n-Sn| = \frac{1}{2}

So true for base case

Assume true for case that n=m

So if n=m+1

|S2m+2-Sm+1|= |S2m+2-S2m+S2m-Sm+1|

Our induction assumption tells us that |S2m-S2m+2|\geq \frac{1}{2} and S2m+2-S2m = \frac{1}{2m+1}+\frac{1}{2m+2}> 0
I don't quite follow that last step. But since ##\{S_n\}## is an increasing sequence you have$$
|(S_{2m+2}-S_{2m}) + (S_{2m}-S_{m+1})|=(S_{2m+2}-S_{2m}) + (S_{2m}-S_{m+1})\ge \frac 1 2$$since the quantities in parentheses are positive.
[Edit]: Ignore the highlighted paragraph. I wasn't completely awake. Look below:

But this problem hardly needs induction. Write out ##S_{2n}-S_n##, look at how many terms there are, and underestimate each by the smallest one.
 
Last edited:
So there are n terms between S2n and Sn the smallest of which is \frac{1}{2n}

It follows that |S2n - Sn|>n(\frac{1}{2n} ) =\frac{1}{2}

That is frustratingly simple. I feel silly but thanks a lot.
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
Replies
6
Views
2K
  • · Replies 7 ·
Replies
7
Views
1K
Replies
2
Views
1K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
14
Views
2K