Putnam CombinatorialIdentity
Challenging
1965

Problem - 4297

Let $\lfloor{x}\rfloor$ be the largest integer not exceeding real number $x$. Show that $$\sum_{k=0}^{\lfloor{\frac{n-1}{2}}\rfloor}\left(\left(1-\frac{2k}{n}\right)\binom{n}{k}\right)^2=\frac{1}{n}\binom{2n-2}{n-1}$$

The solution for this problem is available for $0.99. You can also purchase a pass for all available solutions for$99.