Prove Summation: $\sum_{m=0}^{q} (n-m) \frac{(p-m)!}{m!}$

  • Thread starter Suk-Sci
  • Start date
  • Tags
    Summation
In summary, the given equation is proven using induction, with the base case being q=0 and the assumption that the equation holds for k. The final step is showing that the equation also holds for k+1.
  • #1
Suk-Sci
44
0
prove that: [tex]\sum_{m=0}^{q} (n-m) \frac{(p-m)!}{m!} = \frac{(p+q+1)!}{q!} (\frac{n}{p+1} - \frac{q}{p+2} )[/tex] using induction
 
Last edited:
Mathematics news on Phys.org
  • #2


The "base case", of course, is q= 0:
[tex]\sum_{m=0}^{0} (n-m) \frac{(p-m)!}{m!}= (n-0)\frac{p- 0}{0!}= mp= \frac{(p+ 1)!}{0!}\left(\frac{n}{p+1}\right)[/tex]

Now, assume that
[tex]\sum_{m=0}^{k} (n-m) \frac{(p-m)!}{m!} = \frac{(p+k+1)!}{k!} (\frac{n}{p+1} - \frac{k}{p+2} )[/tex]

Then
[tex]\sum_{m=0}^{k+1} (n-m) \frac{(p-m)!}{m!}= \frac{(p+k+1)!}{k!} (\frac{n}{p+1} - \frac{k}{p+2} )+ (m-k-1)\frac{(p- k- 1)!}{(k+1)!}[/tex]

so you need to show that
[tex] \frac{(p+k+1)!}{k!} (\frac{n}{p+1} - \frac{k}{p+2} )+ (m-k-1)\frac{(p- k- 1)!}{(k+1)!}= \frac{(p+ k+ 2)!}{(k+1)!}\left(\frac{n}{p+1}- \frac{k+1}{p+2}\right)[/tex]
 
  • #3


Thank You...now i have got it ...i made a mistake in m=k+1
 

FAQ: Prove Summation: $\sum_{m=0}^{q} (n-m) \frac{(p-m)!}{m!}$

What does "Prove Summation" mean in this context?

"Prove Summation" refers to the mathematical process of showing that the given equation is true for all values of the variables involved. In this case, it means showing that the given summation formula is valid.

What do the variables in this summation represent?

The variable n represents the upper limit of the summation. The variable p represents the number of items in a set, and the variable q represents the number of items chosen from that set.

What is the purpose of the factorials in this summation?

The factorials represent the number of ways to arrange a certain number of items. In this summation, the factorials are used to calculate the number of ways to choose m items from a set of p items and then arrange them in a certain order.

What is the significance of the variable m in this summation?

The variable m represents the number of items that are being chosen and arranged in the summation. It starts at 0 and increases by 1 with each iteration, until it reaches the upper limit q.

How is this summation useful in scientific research?

This summation formula is useful in various fields of science, such as statistics and probability, as it can be used to calculate the number of possible combinations and permutations of a given set. It can also be used to derive other important equations and formulas in these fields.

Similar threads

Back
Top