×

# General sum

Can anyone tell me how to calculate general sum of sequence till $$n$$ . $1^{4}+2^{4}+3^{4}+ \ldots +n^{4}$

Note by Akshat Sharda
1 year, 12 months ago

Sort by:

Hint:

$\begin{eqnarray} \sum_{k=1}^n \left( (k+1)^2 - k^2 \right) &= &2 \sum_{k=1}^n k + \sum_{k=1}^n 1 \\ \displaystyle (n+1)^2 - 1 &=& 2 \color{blue}{\sum_{k=1}^n k} + n \\ \displaystyle \sum_{k=1}^n k &=& \frac{n(n+1)}2 \end{eqnarray}$

And

$\begin{eqnarray} \sum_{k=1}^n \left( (k+1)^3 - k^3 \right) &= & \sum_{k=1}^n (3k^2 + 3k + 1) \\ \displaystyle (n+1)^3 - 1 &=& 3\color{blue}{ \sum_{k=1}^n k^2} +3 \sum_{k=1}^n k + \sum_{k=1}^n 1 \\ \displaystyle (n+1)^3 - 1 &=& 3\color{blue}{ \sum_{k=1}^n k^2} +3\frac{n(n+1)}2 + n \\ \sum_{k=1}^n k^2 &=& \frac16 n(n+1)(2n+1) \\ \end{eqnarray}$

Can you find a general pattern to it?

Answer is $$\frac1{30} n(n+1)(2n+1)(3n^2 + 3n-1)$$. You can double check your work by induction. · 1 year, 12 months ago

I appriciate what you did and Thank you for the same. · 1 year, 12 months ago

I have a question- Will this pattern work to find general sum of any power of $$n$$? · 1 year, 12 months ago

Study Bernoulli's Numbers. You'll get the answer for nth power sums. :) · 1 year, 12 months ago

I find that more troublesome, unless you got a table for the number of Bernoulli numbers, then yes, it will be easier, otherwise it takes up more time. · 1 year, 12 months ago

Well, it's true. I was just giving a general idea! :) · 1 year, 12 months ago

For positive integer powers, yes. · 1 year, 12 months ago

Study Faulhaber's Formula for a General Idea. Also visit Bernoulli's numbers if it interests you. :) · 1 year, 12 months ago

1/30(n+1)(2n+1)(3n^2+3n-1) · 1 year, 12 months ago

(6x + 15x + 10x - x) / 30 · 1 year, 12 months ago

Hm, that simplifies to just $$x$$. Are you missing some exponents? Staff · 1 year, 12 months ago