How Do You Evaluate the Sum of Reciprocal Factorial Pairs?

  • MHB
  • Thread starter anemone
  • Start date
  • Tags
    2015
In summary, the purpose of finding the solution for POTW #176 is to practice and strengthen skills in working with factorial fractions and to challenge problem-solving abilities. To solve this problem, one should break down the given summation and apply algebraic manipulation and simplification techniques, while also considering the properties of factorial fractions. There are several strategies and techniques that can be used, but there is not necessarily a shortcut or faster way to find the solution. This problem can also be solved using a computer program or calculator, but a solid understanding of the concepts and techniques is still necessary.
  • #1
anemone
Gold Member
MHB
POTW Director
3,883
115
Here is this week's POTW:

-----

Evaluate \(\displaystyle \sum_{k=0}^{n}\dfrac{1}{(n-k)!(n+k)!}\).

-----

Remember to read the http://www.mathhelpboards.com/showthread.php?772-Problem-of-the-Week-%28POTW%29-Procedure-and-Guidelines to find out how to http://www.mathhelpboards.com/forms.php?do=form&fid=2!Evaluate
 
Physics news on Phys.org
  • #2
Congratulations to the following members for their correct solution:):

1. lfdahl
2. kaliprasad
3. noops

Solution from lfdahl:
\[\sum_{j=0}^{2n}\binom{2n}{j} =\sum_{j=0}^{n-1}\binom{2n}{j}+\binom{2n}{n}+\sum_{j=n+1}^{2n}\binom{2n}{j}=2^{2n}\]

The symmetry of binomial coefficients can be expressed as: $\binom{2n}{j}=\binom{2n}{2n-j}$

- and this leads to the following identity:

\[\sum_{j=n+1}^{2n}\binom{2n}{j} = \sum_{j=0}^{n-1}\binom{2n}{j}\;\;\;\; \;\;\;\; (1).\]

So the sum can be written as:

\[\sum_{j=0}^{2n}\binom{2n}{j} = 2\sum_{j=0}^{n-1}\binom{2n}{j}+\binom{2n}{n}\]

and we get an intermediate result:

\[\sum_{j=0}^{n-1}\binom{2n}{j}=\frac{2^{2n}-\binom{2n}{n}}{2} \;\;\;\; \;\;\;\; (2).\]

Now, let´s look at the sum to be evaluated. First, make a change in the index: $j = n-k$:

\[\sum_{k=0}^{n}\frac{1}{(n-k)!(n+k)!} = \sum_{j=0}^{n}\frac{1}{j!(2n-j)!}\]

Next step is to multiply by $\frac{(2n)!}{(2n)!}$:

\[=\frac{1}{(2n)!}\sum_{j=0}^{n}\frac{(2n)!}{j!(2n-j)!} = \frac{1}{(2n)!}\sum_{j=0}^{n}\binom{2n}{j} \].

- now expand the sum to all $2n+1$ terms, and subtract the last $n$ terms:

\[=\frac{1}{(2n)!}\left ( \sum_{j=0}^{2n}\binom{2n}{j}-\sum_{j=n+1}^{2n}\binom{2n}{j} \right ) \]

- make use of $(1)$:

\[= \frac{1}{(2n)!}\left ( 2^{2n} - \sum_{j=0}^{n-1}\binom{2n}{j} \right )\]

- and of $(2)$ to get the result:

\[= \frac{1}{(2n)!}\left ( 2^{2n} - \left ( \frac{2^{2n}-\binom{2n}{n}}{2}\right ) \right ) =\frac{2^{2n-1}+\frac{1}{2}\binom{2n}{n}}{(2n)!}.\]
Alternate solution from noops:
First note that $\frac1{(n-k)!(n+k)!}=\frac1{(2n)!}\binom{2n}{n-k}=\frac1{(2n)!}\binom{2n}{n+k}$.
Now, we have $$\begin{align*} S&=\sum_{k=0}^n \binom{2n}{n+k}\\&=\sum_{k=0}^n \binom{2n}{n-k}\\
&= \sum_{k=0}^n \binom{2n}{k}\\&= \sum_{k=0}^{2n}\binom{2n}{k}-\sum_{k=n+1}^{2n} \binom{2n}{k} \\
&=2^{2n}-\sum_{k=1}^n \binom{2n}{k+n}\\&=2^{2n}+\binom{2n}{n}-S\\
&=2^{2n-1}+\frac12\binom{2n}{n} \end{align*}$$
So that $$ \sum_{k=0}^n \frac1{(n-k)!(n+k)!} = \frac{2^{2n-1}}{(2n)!}+\frac1{2 (n)!^{2}}.$$
 

FAQ: How Do You Evaluate the Sum of Reciprocal Factorial Pairs?

What is the purpose of finding the solution for POTW #176?

The purpose of finding the solution for POTW #176 is to practice and strengthen skills in working with factorial fractions, as well as to challenge one's problem-solving abilities.

How do you approach solving this problem?

When solving this problem, it is helpful to break down the given summation into smaller parts and then apply algebraic manipulation and simplification techniques to find a general formula. It is also important to carefully consider the properties of factorial fractions.

Are there any specific strategies or techniques that can be used to solve this problem?

Yes, there are several strategies and techniques that can be used to solve this problem. Some of these include using the properties of factorial fractions, breaking down the summation into smaller parts, and applying algebraic manipulation and simplification techniques.

Is there a shortcut or faster way to find the solution?

No, there is not necessarily a shortcut or faster way to find the solution for this specific problem. However, with practice and familiarity with factorial fractions, one may be able to solve the problem more efficiently over time.

Can this problem be solved using a computer program or calculator?

Yes, this problem can be solved using a computer program or calculator. However, it is important to have a solid understanding of the concepts and techniques involved in solving the problem in order to accurately input the necessary equations and properly interpret the results.

Back
Top