We are given f(1)+2f(2)+3f(3)+…+xf(x)=x(x+1)f(x) for x≥2, with f(1)=1. Defining S(x)=∑k=1xkf(k) shows that S(x)=x(x+1)f(x) for x≥2.
To find f(2), observe that S(2)=f(1)+2f(2)=1+2f(2) and S(2)=2⋅3⋅f(2)=6f(2), hence 1+2f(2)=6f(2)⟹f(2)=41.
For x≥3, since S(x)−S(x−1)=xf(x), with S(x)=x(x+1)f(x) and S(x−1)=(x−1)xf(x−1), one has x(x+1)f(x)−(x−1)xf(x−1)=xf(x). Simplifying gives x2f(x)=x(x−1)f(x−1) and hence xf(x)=(x−1)f(x−1).
Iterating this recurrence yields xf(x)=(x−1)f(x−1)=…=2f(2)=21, so that f(x)=2x1 for all x≥2.
As a verification, f(3)=61, and S(3)=1+2⋅41+3⋅61=1+21+21=2, while 3⋅4⋅f(3)=12⋅61=2.
Finally, f(2022)1+f(2028)1=2×2022+2×2028=4044+4056=8100.
The correct answer is Option D.