AlgebraDifficulty 7.8National Olympiad, round 2Prove itHong Kong
Let f(n)=(0n)+(3n)+(6n)+⋯+(3⌊3n⌋n)−32n, where [x] is the greatest integer not exceeding x. Find f(1)+f(2)+⋯+f(2021).
Solution
The answer is 898.
Indeed, let ω=e32πi be a cube root of unity. By the binomial theorem, we have (1+1)n=(0n)+(1n)+⋯+(nn), (1+ω)n=(0n)+(1n)ω+⋯+(nn)ωn, (1+ω2)n=(0n)+(1n)ω2+⋯+(nn)ω2n. It is known that 1+ωk+ω2k=0 for any 3∤k, and 1+ωk+ω2k=3 for any 3∣k.
Thus, adding up the above 3 equations, we obtain 3((0n)+(3n)+(6n)+⋯+(3⌊3n⌋n))=(1+1)n+(1+ω)n+(1+ω2)n=2n+(−ω2)n+(−ω)n=⎩⎨⎧2n+22n+12n−12n−2if n≡0(mod6),if n≡1,5(mod6),if n≡2,4(mod6),if n≡3(mod6). Therefore, we have f(n)=31 if 3∤n, and f(n)=32 if 3∣n. As ⌊32021⌋=673, we have f(1)+f(2)+⋯+f(2021)=673(32)+(2021−673)(31)=898.
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.