Number theoryDifficulty 7.1National Olympiad, round 2Prove itHong Kong
How many odd coefficients are there in the expansion of (x2−x+1)2009?
Solution
In the following, we consider polynomials in F2[x]. This means all coefficients are taken modulo 2. Let f(n) be the number of odd coefficients in (x2−x+1)n.
Claim 1. We have (x2−x+1)2k=x2k+1−x2k+1 for any nonnegative integer k. Proof. It suffices to note that (x2−x+1)2=x4−2x3+3x2−2x+1=x4−x2+1. The result follows easily by induction. □
Claim 2. We have f(2ka+b)=f(a)f(b) for any positive integers a,b satisfying b<2k−1. Proof. By claim 1, we have (x2−x+1)2ka+b=((x2−x+1)2k)a(x2−x+1)b=(x2k+1−x2k+1)a(x2−x+1)b. (x2k+1−x2k+1)a=i=1∑scix2kαi, (x2−x+1)b=j=1∑tdjxβj. Then their product is i=1∑sj=1∑tcidjx2kαi+βj. Since we have βj≤2b<2k, different pairs (i,j) correspond to different exponents 2kαi+βj. Also, cidj is odd if and only if both ci and dj are odd. As there are f(a) odd coefficients ci and f(b) odd coefficients dj, the number of odd coefficients is f(a)f(b). □
Claim 3. We have f(2k−1)=32k+2−(−1)k for any positive integer k. Proof. It suffices to make the following observations. For odd k, the coefficients of (x2−x+1)2k−1 follow the pattern 32k−2 triples 110110110⋯11011132k−2 triples 011011011⋯011 while for even k, the coefficients of (x2−x+1)2k−1 follow the pattern 32k−1 triples 110110110⋯110132k−1 triples 011011011⋯011. It is not hard to prove these by induction and claim 1, since 2k+1−1=(2k−1)2k. We omit the details. □
Now, by the above claims, we obtain f(2009)=f(26×31+25)=f(31)f(25)=f(31)f(23×3+1)=f(31)f(3)f(1)=327+1⋅324−1⋅323+1=645.
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.