mjhjmtu

I have a question to find the sum of the following sum:
$$
S = small1*1+2*3+3*5+4*7+...+100*199
$$
I figured out that for each element in this series the following holds:
$$
a_n = a_n-1 + 4n - 3
$$
But I don't know where to go from here, I tried subtracting some other series but that did not work very well

Each term in the equation is $n(2n-1)$, so $$S=sum_n=1^100n(2n-1)=2sum_n=1^100 n^2-sum_n=1^100 n=2fracm(m+1)(2m+1)6-fracm(m+1)2$$
where $m=100$.

By the telescoping sum we obtain: $$sum_n=1^100n(2n-1)=sum_n=1^100left(fracn(n+1)(4n-1)6-frac(n-1)n(4n-5)6right)=$$
$$=frac100cdot101cdot3996=671650.$$

This is, for $n=100$,
$s(n)
=sum_k=1^n k(2k-1)
=sum_k=1^n (2k^2-k)
=2sum_k=1^n k^2
-sum_k=1^n k
$.

Plug in the formulas for the sums
and you are done.

$a_n=sum_r=1^n(4r-3)+a_0=dfrac n2(1+4n-3)+a_0=2n^2-n+a_0$

$$sum_n=1^ma_n=2sum_n=1^mn^2-sum_n=1^mn+a_0sum_n=1^m1$$

Here $a_0=0$

Alternatively,

$$a_m=b_m+a+bm+cm^2$$

$$4n-3=a_n-a_n-1=b_n-b_n-1+b+c(2n-1)=b_n-b_n-1+2c(n)+b-c$$

WLOG set $2c=4,b-c=-3iff c=b+3$ to find $b_n=b_n-1$

set $a=0$ so that $b_m=a_m=0$

Via generating functions we first find the generating function for each term and then sum them up. I'll build from the ground up. It may look overcomplicated but it also doesn't require remembering too many special identities. Our goal is to find $S_99$ where

beginalign*
S_m = sum_n=0^m a_n
endalign*

where

beginalign*
a_0 &= 1 \
a_n &= (n + 1)(2n + 1) \
&= a_n-1 + 4n + 1
endalign*

Now to find the generating function for our $a_n$ we find

beginalign*
A(x) &= sum_n=0^infty a_n x^n \
A(x) - a(0) &= sum_n=1^infty (a_n-1 + 4n + 1) x^n \
A(x) - 1 &= sum_n=1^infty a_n-1x^n + sum_n=1^infty (4n +1) x^n \
A(x) - 1 &= xsum_n=0^infty a_nx^n + (sum_n=0^infty (4n +1) x^n) - (4*0 + 1) \
A(x) &= xA(x) + (4fracx(x - 1)^2 + frac1x-1) \
(1 - x)A(x) &= frac4x + (1 - x)(1 - x)^2 \
A(x) &= frac3x + 1(1 - x)^3
endalign*

Summing them all up is easy enough, since $S_0 = 0$:

beginalign*
S(x) &= sum_n=0^infty S_n x^n \
S(x) - S(0) &= sum_n=1^infty (S_n - 1 + [y^n]A(y)) x^n \
(1 - x)S(x) &= A(x) \
S(x) &= frac3x + 1(1 - x)^4
endalign*

Now we want to find the coefficient for $S(x)$
beginalign*
[x^n]S(x) &= [x^n]frac3x + 1(1 - x)^4 \
&= [x^n]left(3x + 1right) sum_n=0^inftybinomn + 33x^n tag1 \
&= left(3[x^n-1] + [x^n]right) sum_n=0^inftybinomn + 33x^n tag2\
&= 3binomn+23 + binomn+33\
&= frac12(n+2)(n+1)n + frac16(n+3)(n+2)(n+1)
endalign*

• In (1) we use the binomial series representation




• In (2) we use the linearity of the coefficient of operator and $[x^n]x^kS(x)=[x^n-k]S(x)$.

Finally, plugging in $n = 99$: $frac12*101*100*99 + frac16*102*101*100 = 671 650$

Without using any actual intelligence, you can guess that since the terms are roughly quadratic, the sum should be roughly cubic, so you guess that it is a third degree polynomial $an^3 + bn^2 + cn + d$. Then you plug in the values for n = 0, 1, 2, and 3, get for linear equations with four unknowns, and solve to get a, b, c and d.

Try n = 4, 5, 6 to make sure this actually worked, and then it would be easy to prove by induction.