CZ-SK-MO 1983 Problem 4

Consider an arithmetic progression $a_0,\ldots,a_n$ with $n\ge2$ . Prove that $\sum_{k=0}^n(-1)^k\binom{n}{k}a_k=0.$

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.