MHB Find the finite sum of the square and cube exponent of integers

Click For Summary
The discussion focuses on finding formulas for the finite sums of squares and cubes of integers. The formula for the sum of squares, \(\sum_{i=1}^{n} i^2\), is derived using telescoping series, resulting in \(\frac{n(n+1)(2n+1)}{6}\). For the sum of cubes, \(\sum_{i=1}^{n} i^3\), a similar approach is suggested using the expression \((n+1)^4 - 1^4\). Additionally, a general formula involving binomial coefficients is presented to derive sums of higher powers. The conversation emphasizes the mathematical techniques for calculating these sums systematically.
Amer
Messages
259
Reaction score
0
Hey,
it is clear for me that
\sum_{i=1}^{n} i = \frac{n(n+1)}{2}

how to find a formula for
\sum_{i=1}^{n} i^2
\sum_{i=1}^{n} i^3
Thanks
 
Physics news on Phys.org
One method is to use telescoping.

$$(n+1)^3-1^3$$​

$$=\ \sum_{i=1}^n\left[(i+1)^3-i^3\right]$$

$$=\ \sum_{i=1}^n\left[3i^2+3i+1\right]$$

$$=\ 3\sum_{i=1}^ni^2+\frac32n(n+1)+n$$

From this you should get $$\sum_{i=1}^ni^2=\frac{n(n+1)(2n+1)}6$$.

For $$\sum_{i=1}^ni^3$$, try $$(n+1)^4-1^4=\sum_{i=1}^n\left[(i+1)^4-i^4\right]$$.
 
Re: find the finite sum of the square and cube exponent of integers

nice method thanks
 
Re: find the finite sum of the square and cube exponent of integers

Amer said:
Hey,
it is clear for me that
\sum_{i=1}^{n} i = \frac{n(n+1)}{2}

how to find a formula for
\sum_{i=1}^{n} i^2
\sum_{i=1}^{n} i^3
Thanks

In general if...

$\displaystyle S_{n,k}= \sum_{i=1}^{n} i^{k}$ (1)

... then...

$\displaystyle \binom{k+1}{1}\ S_{n,1} + \binom{k+1}{2}\ S_{n,2} + ... + \binom{k+1}{k}\ S_{n,k}= (n+1)^{k+1} - (n+1)$ (1)

From (1) You easily obtain... $\displaystyle S_{n,k}= \frac{1}{\binom{k+1}{k}}\ \{(n+1)^{k+1} - (n+1) - \sum_{i=1}^{k-1}\ \binom {k+1}{i} S_{n,i}\ \}$ (2)

The (2) allows You, given $S_{n,1}$ to find $S_{n,2}$ and given $S_{n,1}$ and $S_{n,2}$ to find $S_{n,3}$ and if You want You can proceed... Kind regards $\chi$ $\sigma$
 
There are probably loads of proofs of this online, but I do not want to cheat. Here is my attempt: Convexity says that $$f(\lambda a + (1-\lambda)b) \leq \lambda f(a) + (1-\lambda) f(b)$$ $$f(b + \lambda(a-b)) \leq f(b) + \lambda (f(a) - f(b))$$ We know from the intermediate value theorem that there exists a ##c \in (b,a)## such that $$\frac{f(a) - f(b)}{a-b} = f'(c).$$ Hence $$f(b + \lambda(a-b)) \leq f(b) + \lambda (a - b) f'(c))$$ $$\frac{f(b + \lambda(a-b)) - f(b)}{\lambda(a-b)}...

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 16 ·
Replies
16
Views
4K
  • · Replies 14 ·
Replies
14
Views
3K