Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $j$ be an integer. Let $r$ be an even integer such that $r\in 1,\ldots,2j$.

For a given integer $u$, I want to prove the following identity:

$$\sum_{n=0}^u \sum_{k=0}^{2j}\sum_{p=0}^r \frac{\binom{k}{p}\binom{2j-k}{r-p}\binom{2j}{k}\binom{j-1-n}{u-n}}{(2n+2)!}(-1)^{r-p+u-n}2^{2(n-j+1)}(k-j)^2\prod_{l=1}^{n}((k-j)^2-l^2)=\begin{cases}\binom{2j}{r} &\text{ if }r=2(u+1)\\\\ 0 &\text{ else}\end{cases}$$

I tried with different values of $j$, $u$, and $r$ and this was always true. Does someone have an idea on how to prove it or prove it wrong?

Thank you!

share|cite|improve this question

Your best bet is a computer algebra package (Wolfram Alpha or Maxima would do fine) and the Gosper-Zeilberger algorithm (see Petkovsek, Wilf, Zeilberger's "A = B" for a detailed description).

share|cite|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.