How can I solve this sum?
$$S_{n} = \sum_{k=1}^{n} k \Big( \frac{3}{2} \Big)^{k-1}$$
Worth noting: I can use lower index $k = 0$ instead of $k = 1 $, because the result does not change.
I have tried using "perturbation method".
Perturbation method:
$$S_{n} + x_{n+1} = x_{0} + \sum_{k=1}^{n+1} x_{k}$$
$$S_{n} + x_{n+1} = x_{0} + \sum_{k=0}^{n} x_{k+1}$$
My attempt:
$$S_{n} + (n+1) \Big( \frac{3}{2} \Big)^{n} = \sum_{k=0}^{n} (k+1)\Big(\frac{3}{2}\Big)^{k}$$
$$S_{n} + (n+1) \Big( \frac{3}{2} \Big)^{n} = \underbrace{\sum_{k=0}^{n} k \Big(\frac{3}{2}\Big)^k}_{\text{stuck here}} + \sum_{k=0}^{n} \Big(\frac{3}{2}\Big)^{k}$$
I have tried perturbing the "stuck here" sum, but it leads to infinite loop of perturbations, I think.
I'm new to sums and sequences so I don't know the tricks yet, and I think I am missing something simple to solve it.
WolframAlpha gives result:
$$\sum_{k=1}^{n} k \Big( \frac{3}{2} \Big)^{k-1} = 2 \Bigg( \Big( \frac{3}{2} \Big)^n (n-2) + 2 \Bigg)$$ Thanks for tips.