Copyright Boris Spokoinyi, 2003

I dont guarantee that these solutions are error free!

n

Derivation of formula for

n

n +1

( i + 1) = i = i + ( n + 1)
3

i =1

i= 2

but:

( i + 1)

i =1

i =1

3
1 (from property of summation)

(1)

i =1

= ( i + 3i + 3i + 1)
n

(2)

i =1

n
n (n + 1)
and 1 = n :
2
i =1
i =1
n
n
n
n
n
n
n( n + 1)
i3 + 3 i2 + 3 i + 1 = i 3 +3 i2 + 3 2 + n
i =1
i =1
i =1
i= 1
i =1
i= 1
n

from RHS of (2) and substituting i =

equating RHS of (3) and RHS of (1):

n
n
n
n( n + 1)
3
i 3 + 3 i2 + 3
+ n = i 3 + ( n + 1) 1

2
i= 1
i =1
i =1
after rearranging:
n
1
n( n + 1)
3
i2 = 3 ( n + 1) 1 n 3 2
i =1
1 3
3 2 3n
2
= n + 3n + 3n + 1 1 n n
3
2
2
3
2
3
2
2
n
n
n 2n + 3n + n n( 2n + 3n + 1) n (n +1 )( 2n + 1)
= + + =
=
=
3 2 6
6
6
6
n

Thus:

i
i =1

n (n + 1 )( 2n + 1)
6

(3)

Derivation of formula for

n+ 1

i= 2

i =1

i =1

( i + 1) = i4 = i 4 + ( n +1) 14 (from property of summation)

4

i =1

( i + 1)

but:

i =1

= ( i + 4i + 6i + 4i + 1)
n

i =1

i= 1

i =1

n( n +1 )( 2n + 1) n
n( n + 1)
, i =
and
6
2
i =1

1 = n :
i =1

+4 i + 6 i + 4 i + 1

i =1

i =1

(2)

i =1

from RHS of (2) and substituting i 2 =

n

(1)

i =1

i =1

+4 i + 6
3

i =1

n( n +1 )( 2n + 1)
n( n + 1)
+4
+n
6
2

equating RHS of (3) and RHS of (1):

n
n
n (n +1 )(2n + 1)
n (n + 1)
4
i
+
4
i3 + 6
+4
+n =

6
2
i= 1
i= 1

(3)

i + ( n +1)
4

14

i= 1

after rearranging:
n
1
4
i3 = 4 ( n + 1 ) 1 n 2n(n + 1) n(n + 1 )(2n + 1)
i =1
1
= n4 + 4n3 + 6 n2 + 4n + 1 1 n ( 2n 2 + 2n ) ( 2n3 + 3n 2 + n )

4
1
= n4 + 4n3 + 6 n2 + 4n n 2n2 2n 2n 3 3n 2 n
4
1
n2
n 2 (n + 1) 2
= n4 + 2n3 + n2 = n 2 + 2n + 1 =
4
4
4

Thus:

i3 =
i =1

n 2 ( n + 1) 2
4

Derivation of a general formula for

i =1

, where k
n

In general we see that to find the formula for power k we need to use

( i + 1)

k +1

i =1

Using similar arguments as on the first two pages and using property of summation:
n

( i + 1)
i =1

k +1

n+ 1

= i

k+1

i =2

= i

k +1

i =1

+ ( n + 1)

k+ 1

(1)

To make the derivation look better lets define S j [ n] to be

i =1

Using Binomial Theorem (see next page for definition) on LHS of (1):
n
k +1 ( k + 1)!

Sk +1[ n] =
ij
(2)
i =1 j = 0 (k + 1 j )! j !
Using the fact that we can interchange the summations:
k +1
n ( k + 1)!

Sk +1[ n] =
ij
(3)
j =0 i =1 (k + 1 j )! j !
(k + 1)!
Since
is constant with respect to i, then we can pull it out from the inner sum:
( k + 1 j)! j !
k +1
( k + 1)! n j
Sk +1[ n] =
(4)
i
j =0 ( k + 1 j )! j ! i = 1

n
But i j , S j [ n] , is the sum formula for power j; (4) becomes:
i =1
k +1
( k + 1)!

Sk +1[ n] =
S j [ n]
(5)
j =0 ( k + 1 j )! j !

But we are looking for Sk [ n] and since the formula (5) depends on Sk [ n] and Sk +1[ n] (look at the
summation limit) we would like to pull them out of the sum; (5) becomes:
k 1

( k + 1)!

( k + 1)!

( k + 1)!

(k + 1 j )! j ! S [n] + ( k + 1 k )!k ! S [n] + ( k + 1 k 1 )!(k + 1)! S

j

j= 0

k+ 1

[n ]

k 1
( k + 1)!
(k + 1)!
( k + 1)!
=
S j [ n] +
Sk [ n] +
S k +1[ n]
k!
( k + 1)!
j =0 ( k + 1 j )! j !

k 1
n
(k + 1)!

k+ 1
=
S j[ n] + ( k + 1) Sk [ n] + Sk +1[ n] = ( i + 1)
(6)
j = 0 ( k + 1 j )! j !
i= 1

equating LHS of (6) and RHS of (1):

k 1
n
( k + 1)!

k +1
k+ 1
S
[
n
]
+
(
k
+
1
)
S
[
n
]
+
S
[
n
]
=
i k +1 + ( n + 1) 1 = S k +1[ n] + ( n + 1) 1

k
k +1

j = 0 ( k + 1 j )! j !
i =1

rearranging:
k 1
k +1
( k + 1)!

( k + 1) S k [ n] + S k + 1[n ] = S k +1[ n] + ( n + 1) 1
S j [ n]
j =0 ( k + 1 j )! j !

and finally dividing by (k+1) and using Binomial Theorem on ( n + 1)

k +1

i
i =1

( k + 1)!

k 1

k +1

( k + 1)!

(k +1 l )!l ! n 1 (k + 1 j)! j ! S [n]

l= 0

j =0

k +1

Binomial Theorem
Binomial Theorem gives a general polynomial expansion for ( a + b) n :
n
n!
n
n k k
(a + b ) =
a b
k =0 ( n k )! k !
(n! is called factorial of n, for definition see the bottom of the page)
The theorem is usually proved using induction and the proof is not included here.
Examples of use of Binomial Theorem:
2!
2!
2!
( a + b) 2 =
a 2 0b0 +
a 2 1b1 +
a 2 2b2 = a 2 + 2ab + b 2
( 2 0 )!0 !
( 2 1 )!1!
( 2 2 )!2 !
3!
3!
3!
3!
( a + b) 3 =
a 3 0b0 +
a 3 1b1 +
a 3 2b 2 +
a3 3b3 = a 3 + 3a 2b + 3ab2 + b3
(3 0 )!0 !
( 3 1 )!1!
( 3 2 )! 2!
( 3 3 )!3 !

Factorials
n! is called a factorial of n and is defined as follows:
n ! = n(n-1)(n-2)...(1) for n>0
Example: 3 ! = 3 2 1 = 6
Some properties of factorials:
n ! = n [( n 1)!]
1!=1
0!=1
(-x)!=0, where x>0