BinomialExpansion Symmetry Difficult

Problem - 2694

Let $m=4k+1$ where $k$ is a non-negative integer. Show that $$a=\binom{n}{1}+m\binom{n}{3}+m^2\binom{n}{5}+\cdots+m^{\frac{n-1}{2}}\binom{n}{n}$$

is divisible by $2^{n-1}$, where $n$ is an odd number.


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

report an error