Summation of Series: Prove 1/4 - 1/(2n+2)

  • Context: MHB 
  • Thread starter Thread starter Erfan1
  • Start date Start date
  • Tags Tags
    Series Summation
Click For Summary
SUMMARY

The forum discussion centers on proving the summation of the series defined by the equation 1/(1*2*3) + 1/(2*3*4) + ... + 1/(n*(n+1)*(n+2)) = 1/4 - 1/(2*(n+1)*(n+2)). Participants suggest using methods such as partial fraction decomposition and mathematical induction to derive the proof. The discussion highlights the successful application of the Heaviside cover-up method for partial fractions, confirming the validity of the decomposition and the telescoping nature of the series.

PREREQUISITES
  • Understanding of telescoping series
  • Familiarity with partial fraction decomposition
  • Knowledge of mathematical induction
  • Basic skills in algebraic manipulation of series
NEXT STEPS
  • Study the Heaviside cover-up method for partial fractions
  • Explore advanced techniques in mathematical induction
  • Research properties of telescoping series in calculus
  • Practice solving similar summation problems using different methods
USEFUL FOR

Mathematicians, educators, students studying calculus or series, and anyone interested in advanced mathematical proofs and techniques.

Erfan1
Messages
9
Reaction score
0
Prove that 1/(1*2*3) + 1/(2*3*4) + ... + 1/(n*(n+1)*(n+2)) = 1/4 - 1/(2*(n+1)*(n+2)
.
 
Physics news on Phys.org
Hello Erfan,

Are you expected to use partial fraction decomposition or induction, or is the choice of method up to you? Can you show us what you have tried so far?
 
Erfan said:
Prove that 1/(1*2*3) + 1/(2*3*4) + ... + 1/(n*(n+1)*(n+2)) = 1/4 - 1/(2*(n+1)*(n+2)
.

This looks like a telescopic series to me...
 
MarkFL said:
Hello Erfan,

Are you expected to use partial fraction decomposition or induction, or is the choice of method up to you? Can you show us what you have tried so far?

Partial fractions !

I tried this 1/(r*(r+1)*(r+2)) = 1/(2r) - 1/(r+1) + 1/(2(r+2))
but it seems that this doesn't work :D
 
Erfan said:
Prove that 1/(1*2*3) + 1/(2*3*4) + ... + 1/(n*(n+1)*(n+2)) = 1/4 - 1/(2*(n+1)*(n+2)
.

It is convenient to proceed by induction. Let's suppose that... $\displaystyle S_{n}= \frac{1}{1 \cdot 2 \cdot 3} + \frac{1}{2 \cdot 3 \cdot 4} + ... + \frac{1}{n \cdot (n+1) \cdot (n+2)} = \frac{1}{4} - \frac{1}{2 \cdot (n+1) \cdot (n+2)}\ (1)$

... is true for some n [it is true for n=2...]. Then is... $\displaystyle S_{n+1} = \frac{1}{4} - \frac{1}{2 \cdot (n+1) \cdot (n+2)} + \frac{1}{(n+1) \cdot (n+2) \cdot (n+3)} = \frac{1}{4} - \frac{1}{2 \cdot (n+2) \cdot (n+3)}\ (2)$ ... and that proves the statement... Kind regards $\chi$ $\sigma$
 
Erfan said:
Partial fractions !

I tried this 1/(r*(r+1)*(r+2)) = 1/(2r) - 1/(r+1) + 1/(2(r+2))
but it seems that this doesn't work :D
Yes it does work! Try it like this: $$\begin{array}{cccccc} S_n = \frac{1/2}1 &- \frac12 &+ \frac{1/2}3 \\ & + \frac{1/2}2 &- \frac13 &+ \frac{1/2}4 \\ && + \frac{1/2}3 &- \frac14 &+ \frac{1/2}5 \\ &&& + \frac{1/2}4 &-\frac15 &+\frac{1/2}6 \\ &&&& + \ldots, \end{array}$$ continuing like that until you get to the row $+\dfrac{1/2}n - \dfrac1{n+1} + \dfrac{1/2}{n+2}.$ Notice that apart from a few terms at the beginning and end of the sum, the terms in each column add up to $0$.
 
I would write the sum as:

$$\sum_{k=1}^n\left(\frac{1}{k(k+1)(k+2)} \right)$$

Now, using the Heaviside cover-up method on the summand:

$$\frac{1}{k(k+1)(k+2)}=\frac{A}{k}+\frac{B}{k+1}+ \frac{C}{k+2}$$

$$A=\frac{1}{2},\,B=-1,\,C=\frac{1}{2}$$

You had the correct decomposition. Thus, our sum may be written:

$$\sum_{k=1}^n\left(\frac{1}{2k}-\frac{1}{k+1}+\frac{1}{2(k+2)} \right)$$

$$\frac{1}{2}\sum_{k=1}^n\left(\frac{1}{k} \right)-\sum_{k=1}^n\left(\frac{1}{k+1} \right)+\frac{1}{2}\sum_{k=1}^n\left(\frac{1}{k+2} \right)$$

I would split the middle sum into two halves and group as follows:

$$\frac{1}{2}\left(\left(\sum_{k=1}^n\left(\frac{1}{k} \right)-\sum_{k=1}^n\left(\frac{1}{k+1} \right) \right)+ \left(\sum_{k=1}^n\left(\frac{1}{k+2} \right)-\sum_{k=1}^n\left(\frac{1}{k+1} \right) \right) \right)$$

Now, re-indexing the first sum in each group, we may write:

$$\frac{1}{2}\left(\left(\sum_{k=0}^{n-1}\left(\frac{1}{k+1} \right)-\sum_{k=1}^n\left(\frac{1}{k+1} \right) \right)+ \left(\sum_{k=2}^{n+1}\left(\frac{1}{k+1} \right)-\sum_{k=1}^n\left(\frac{1}{k+1} \right) \right) \right)$$

We want to get the sums to cancel, so let's look at the first group:

$$\sum_{k=0}^{n-1}\left(\frac{1}{k+1} \right)-\sum_{k=1}^n\left(\frac{1}{k+1} \right)$$

Pulling of the first term from the first sum and the last term from the second, we have:

$$1+\sum_{k=1}^{n-1}\left(\frac{1}{k+1} \right)-\sum_{k=1}^{n-1}\left(\frac{1}{k+1} \right)-\frac{1}{n+1}$$

And so we are left with:

$$1-\frac{1}{n+1}$$

Let's next look at the second group:

$$\sum_{k=2}^{n+1}\left(\frac{1}{k+1} \right)-\sum_{k=1}^n\left(\frac{1}{k+1} \right)$$

Pulling off the last term from the first sum and the first term from the second, we have:

$$\sum_{k=2}^{n}\left(\frac{1}{k+1} \right)+\frac{1}{n+2}-\frac{1}{2}-\sum_{k=2}^n\left(\frac{1}{k+1} \right)$$

And so we are left with:

$$\frac{1}{n+2}-\frac{1}{2}$$

Our sum may then be written as:

$$\frac{1}{2}\left(1-\frac{1}{n+1}+\frac{1}{n+2}-\frac{1}{2} \right)$$

$$\frac{1}{2}\left(\frac{1}{2}+\frac{1}{(n+1)(n+2)} \right)$$

$$\frac{1}{4}+\frac{1}{2(n+1)(n+2)}$$
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 4 ·
Replies
4
Views
916
  • · Replies 5 ·
Replies
5
Views
1K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 6 ·
Replies
6
Views
4K