Let $p$ be an odd prime. Is it true that $$-\left(\begin{array}{c}p+1\\ 2\end{array}\right)+\left(\begin{array}{c}p+1\\ 3\end{array}\right)\dots+\left(\begin{array}{c}p+1\\ p\end{array}\right)-\left(\begin{array}{c}p+1\\ p+1\end{array}\right)=p?$$

I could show that it is true for $p\in\{3,5\}$, but I could not prove it. Any help will be greatly appreciated!

Note: For positive integers $k$ and $n$, where $k\leq n$, we define $\left(\begin{array}{c}n\\ k\end{array}\right)=\frac{n!}{k!(n-k)!}$.

  • $\begingroup$ Hint: adding $-1 + \binom{p+1}{1}$ to both sides and apply binomial theorem. $\endgroup$ – achille hui Oct 7 '16 at 8:23

It isn’t true: for $p=3$ you have $-\binom42+\binom43=-6+4=-2$. You need to switch the signs, so that the first term is positive. Then it’s true much more generally.

For any $n>0$ we have


you see this by recognizing the summation as the expanion of $\big((-1)+1\big)^n$ using the binomial theorem (and in various other ways as well). After you reverse your signs, what you have (when $n=p+1$) is

$$\begin{align*} \sum_{k=2}^n(-1)^k\binom{n}k&=\sum_{k=0}^n(-1)^k\binom{n}k-\sum_{k=0}^1(-1)^k\binom{n}k\\ &=0-\binom{n}0+\binom{n}1\\ &=n-1\;. \end{align*}$$

  • $\begingroup$ Dear Stefan Kober and Brian M. Scott many thanks for your exact answers! $\endgroup$ – sebastian Oct 7 '16 at 21:30
  • $\begingroup$ @sebastian: You're very welcome. $\endgroup$ – Brian M. Scott Oct 7 '16 at 22:56


as $\binom{p+1}{i}=\binom{p+1}{i+2(i-\frac{p+1}{2})}\hspace{10mm}\forall i<\frac{p+1}{2}$ as the binom is symmetric and $p+1$ is even.

From there you just take

$$\sum_{i=0}^{p+1}\binom{p+1}{i}(-1)^{i+1} + \binom{p+1}{1}-\binom{p+1}{0}=0+p+1-1=p$$

to eliminate the first 2 elements

You just need to reverse the signs to do this


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

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