Maths Olympiad Prep

Library / /3 of 3

Algebra Difficulty 5.6 AIME, harder Prove it United States

Problem:
Let dd be a fixed positive integer. Prove that there exists a unique polynomial S(n)S(n) such that for every integer n0n \geq 0, S(n)=k=0nkd=0d+1d++ndS(n) = \sum_{k=0}^{n} k^{d} = 0^{d} + 1^{d} + \cdots + n^{d}. Also prove that S(n)S(n) can be expressed in the form
c0+c1(2n+1)+c2(2n+2)2++cd+1(2n+1)d+1 c_{0} + c_{1}(2n+1) + c_{2}(2n+2)^{2} + \cdots + c_{d+1}(2n+1)^{d+1}
where the cic_{i} are rational numbers such that cici+1=0c_{i} c_{i+1} = 0 for i=0,1,,di = 0, 1, \ldots, d.

Solution

Solution:
We shall prove by strong induction on d0d \geq 0 the existence of a polynomial Pd(x)P_{d}(x) of degree d+1d+1 with rational coefficients such that
- the exponents of xx which occur with nonzero coefficients are all of opposite parity from dd;
- Pd(2n+1)Pd(2n1)=ndP_{d}(2n+1) - P_{d}(2n-1) = n^{d} (defined to be 11 when n=d=0n = d = 0);
- Pd(1)=1/2P_{d}(1) = 1/2 if d=0d = 0, and Pd(1)=0P_{d}(1) = 0 otherwise.

Then, S(n)=Pd(2n+1)S(n) = P_{d}(2n+1) will meet our requirements (we know S(n)=0d++ndS(n) = 0^{d} + \cdots + n^{d} by using the second property of PdP_{d} to form a telescoping sum).

The base cases are P0(x)=x/2P_{0}(x) = x/2, P1(x)=(x21)/8P_{1}(x) = (x^{2} - 1)/8. If d>1d > 1, consider what happens when (2n+1)d+1(2n1)d+1(2n+1)^{d+1} - (2n-1)^{d+1} is expanded by the binomial theorem. The result is a polynomial in nn, in which the powers having the same parity as d+1d+1 cancel, leaving cdnd+cd2nd2++c2d/2n2d/2c_{d} n^{d} + c_{d-2} n^{d-2} + \cdots + c_{2\lfloor d/2 \rfloor} n^{2\lfloor d/2 \rfloor} where, using the binomial theorem, ck=2k+1(d+1k)c_{k} = 2^{k+1} \binom{d+1}{k}.

Now first suppose dd is odd. By the induction hypothesis, for any odd k<dk < d, there exists a rational polynomial PkP_{k} meeting the conditions above (and every exponent of xx is even). Then
Pd(x)=xd+1cd2Pd2(x)cd4Pd4(x)c1P1(x)1cd P_{d}(x) = \frac{x^{d+1} - c_{d-2} P_{d-2}(x) - c_{d-4} P_{d-4}(x) - \cdots - c_{1} P_{1}(x) - 1}{c_{d}}
meets all the conditions.

If, instead, dd is even, then for any even k<dk < d, there exists an odd rational polynomial PkP_{k} meeting these conditions, and
Pd(x)=xd+1cd2Pd2(x)cd4Pd4(x)c0P0(x)cd P_{d}(x) = \frac{x^{d+1} - c_{d-2} P_{d-2}(x) - c_{d-4} P_{d-4}(x) - \cdots - c_{0} P_{0}(x)}{c_{d}}
meets our requirements—the first two are clear, and, for the third, we use our earlier computation that c0=2c_{0} = 2 to find
1d+1c0P0(1)cd=11cd=0 \frac{1^{d+1} - c_{0} P_{0}(1)}{c_{d}} = \frac{1 - 1}{c_{d}} = 0
as claimed. Thus PdP_{d} exists as needed.

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: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.