Induction with sum on left and right side.

  • Thread starter Thread starter Tremoi
  • Start date Start date
  • Tags Tags
    Induction Sum
Click For Summary
SUMMARY

The equation \sum_{k=1}^{n}(\frac{1}{2k-1} - \frac{1}{2k}) = \sum_{k=1}^{n}\frac{1}{k + n} holds true for all integers \( n \geq 1 \). The proof utilizes mathematical induction, starting with the base case \( n = 1 \) and assuming the statement is valid for \( n \). The induction step demonstrates that if the statement is true for \( n \), it also holds for \( n + 1 \) by manipulating the sums and changing variables appropriately.

PREREQUISITES
  • Understanding of mathematical induction
  • Familiarity with summation notation
  • Basic knowledge of algebraic manipulation
  • Concept of series convergence
NEXT STEPS
  • Study mathematical induction techniques in depth
  • Explore advanced summation techniques and transformations
  • Learn about series convergence criteria
  • Investigate other proofs involving summation identities
USEFUL FOR

Students studying mathematics, particularly those focusing on calculus and algebra, as well as educators looking for examples of induction proofs.

Tremoi
Messages
1
Reaction score
0

Homework Statement


Does
[itex]\sum_{k=1}^{n}(\frac{1}{2k-1} - \frac{1}{2k}) = \sum_{k=1}^{n}\frac{1}{k + n}[/itex]
hold for [itex]1 \leq n[/itex]


Homework Equations





The Attempt at a Solution


It holds for n = 1. I assume that it should be done with induction but I can't find a way actually compare the two sums to each other. I then had an idea about maybe putting each sum on a common denominator and prove that the both denominators and the both numerators are equal but that's not true so I don't really know where to start.
The left terms can be rewritten as [itex]\frac{1}{2k(2k-1)}[/itex] as well but that haven't really helped me either.
 
Physics news on Phys.org
You can prove this using induction. Using the usual induction techniques, define [itex]f(n) = \sum\limits_{k=1}^{k=n}\left(\frac{1}{2k-1} - \frac{1}{2k}\right)[/itex]. You want to show [itex]f(n) = \sum\limits_{k=1}^{k=n} \frac{1}{k+n}[/itex]. You've already shown that this is true for [itex]n=1[/itex]. Assuming the statement is true for [itex]n[/itex]
[tex] f(n+1)\\<br /> = \sum\limits_{k=1}^{k=n+1}\left(\frac{1}{2k-1} - \frac{1}{2k}\right) = f(n) + \frac{1}{2n+1} - \frac{1}{2n+2} \\<br /> = \sum\limits_{k=1}^{k=n} \frac{1}{k+n}+ \frac{1}{2n+1} - \frac{1}{2n+2}[/tex]
Now changing the variable in the sum [itex]k \to k' = k-1[/itex]. The sum becomes
[tex] f(n+1) \\<br /> = \sum\limits_{k'=0}^{k'=n-1} \frac{1}{k'+n+1}+ \frac{1}{2n+1} - \frac{1}{2n+2} \\<br /> = \sum\limits_{k'=1}^{k'=n-1} \frac{1}{k'+n+1} + \frac{1}{n+1}+ \frac{1}{2n+1} - \frac{1}{2n+2}\\<br /> = \sum\limits_{k'=1}^{k'=n-1} \frac{1}{k'+n+1}+ \frac{1}{2n+1} + \frac{1}{2n+2}\\<br /> =\sum\limits_{k'=1}^{k'=n+1} \frac{1}{k'+n+1}[/tex]

Thus, the statement is true!
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
7
Views
4K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 12 ·
Replies
12
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K