IMC 2015, Day 2, Problem 8
Consider all words of length in the Latin alphabet. Define the weight of a word as , where is the number of letters not used in this word. Prove that the sum of the weights of all words is .
Original from the official PDF

This transcription was compared symbol by symbol with the original, but not yet by a person.
Work for at least 45 minutes before opening the solution.
Official solution
(Proposed by Fedor Petrov, St. Petersburg State University)
Solution. Let , then . We use the following well-known
Lemma. If is a polynomial of degree at most , then its -st finite difference vanishes: .
Proof. If is the operator which maps to , then is indeed -st power of and the claim follows from the observation that decreases the power of a polynomial.
In other words, . Applying this for , substituting and denoting we get
Transcribed from the official solutions, pages 2–3. This transcription has not been checked a second time; if in doubt, look at the original.
Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.
How did it go?
Moves you mark come back sooner in triage.