We have to find the coefficient of x50 in the finite sum
S(x)=(1+x)1000+x(1+x)999+x2(1+x)998+…+x1000.
The general (that is, the k-th) term of this sum is obtained by taking the exponent of x equal to k and the exponent of (1+x) equal to 1000−k. Thus the k-th term is
Tk=xk(1+x)1000−k,k=0,1,2,…,1000.
Inside this term the binomial expansion formula
(1+x)n=∑r=0n(rn)xr
tells us that the power of x that finally appears is k+r, and its coefficient there is (r1000−k).
We want the overall power to be exactly 50, so we impose
k+r=50.
Since k runs from 0 up to 1000, only those k with k≤50 can possibly satisfy this equality (otherwise k+r would exceed 50 because r≥0). Therefore we let
k=0,1,2,…,50.
For a fixed k in this range the corresponding r is
r=50−k,
so the contribution of the k-th term to the coefficient of x50 is
(50−k1000−k).
Hence the required coefficient, call it C, is the sum
C=∑k=050(50−k1000−k).
It is convenient to reverse the index so that the upper number inside the binomial sign increases with the index. Put
r=50−k⟹k=50−r.
When k goes from 0 to 50, the new index r goes from 50 down to 0, i.e. from 0 to 50 after re-ordering. Substituting k=50−r inside the binomial coefficient gives
(r1000−(50−r))=(r950+r).
Therefore
C=∑r=050(r950+r).
Now we invoke a standard “hockey-stick” identity of binomial coefficients:
∑r=0n(rm+r)=(nm+n+1).
Here m=950 and n=50, so
C=(50950+50+1)=(501001).
Writing this binomial coefficient in factorial form (using (kN)=k!(N−k)!N!) we obtain
C=50!951!1001!.
This expression exactly matches Option D in the list provided.
Hence, the correct answer is Option D.