We have been given the finite sum
Sn=1(n−1)+2(n−2)+3(n−3)+⋯+(n−1)1,
where n≥4, and we are asked to evaluate the infinite series
∑n=4∞[n!2Sn−(n−2)!1].
First, we find a closed form for Sn.
Write each term of Sn in the form k(n−k), where the index k runs from 1 to n−1. So
Sn=∑k=1n−1k(n−k)=∑k=1n−1(kn−k2).
We now separate the two sums:
Sn=n∑k=1n−1k−∑k=1n−1k2.
We next recall the standard formulas:
• Sum of the first m natural numbers: k=1∑mk=2m(m+1).
• Sum of the squares of the first m natural numbers: k=1∑mk2=6m(m+1)(2m+1).
Here, m=n−1. Substituting m=n−1 into both formulas gives
∑k=1n−1k=2(n−1)n,∑k=1n−1k2=6(n−1)n(2n−1).
Hence
Sn=n[2(n−1)n]−6(n−1)n(2n−1).
Simplifying step by step, we factor out the common factor (n−1)n:
Sn=(n−1)n[2n−62n−1].
Inside the brackets we put everything over a common denominator 6:
2n=63n,63n−62n−1=63n−2n+1=6n+1.
Therefore
Sn=(n−1)n[6n+1]=6(n−1)n(n+1).
Now we turn to the required general term of the series:
n!2Sn−(n−2)!1=n!2⋅6(n−1)n(n+1)−(n−2)!1=3n!(n−1)n(n+1)−(n−2)!1.
Write n! as n(n−1)(n−2)! and cancel:
3n!(n−1)n(n+1)=3n(n−1)(n−2)!(n−1)n(n+1)=3(n−2)!n+1.
So the entire term becomes
3(n−2)!n+1−(n−2)!1=[3n+1−1](n−2)!1=3n+1−3⋅(n−2)!1=3n−2⋅(n−2)!1.
Notice that for any positive integer k we have the identity
k!k=(k−1)!1,
because k!=k(k−1)!.
Putting k=n−2, we get
(n−2)!n−2=(n−3)!1.
Therefore the nth term of our series simplifies beautifully to
31⋅(n−3)!1.
Hence the required infinite sum is
∑n=4∞[n!2Sn−(n−2)!1]=31∑n=4∞(n−3)!1.
Let us shift the index to expose the familiar Maclaurin expansion of ex.
Put m=n−3⟹n=4⇒m=1. Then
∑n=4∞(n−3)!1=∑m=1∞m!1.
We recall the well-known series for Euler’s number e:
e=∑m=0∞m!1=1+∑m=1∞m!1.
Thus
∑m=1∞m!1=e−1.
Substituting this result back, we get
∑n=4∞[n!2Sn−(n−2)!1]=31(e−1)=3e−1.
Hence, the correct answer is Option B.