A number or a short expression. Spacing and $ signs are ignored.
Solution
Let Tn=∑k=0n(kn−k)2k. From Pascal's recursion for binomial coefficients, we can find Tn=2Tn−2+Tn−1, with T0=1 and T1=1. The characteristic polynomial of this recursion is x2−x−2=0, which has roots 2 and -1. Thus Tn=a⋅2n+b⋅(−1)n for some a and b. From the initial conditions we have a+b=1 and 2a−b=1. It follows that a=2/3 and b=1/3, from which the conclusion follows.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: Omni-MATH,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.