(ii)
Since dB
n(x)/dx = nB
n-1(x)
∫
01dB
n(x) = n∫
01B
n-1(x) dx
but ∫
01B
n(x)dx = 0
Replacing n with n - 1:
∫
01B
n-1(x)dx = 0
Also: ∫
01dB
n(x) = B
n(1) - B
n(0)
Hence the result follows.
(iii)
For n=1
LHS = B
1(x + 1) - B
1(x)
= x + 1 - 1/2 - (x - 1/2)
= 1
RHS = 1.x
1 - 1
= 1
.: LHS=RHS hence statement is true for n=1
Assume true for n=k
B
k(x + 1) - B
k(x) = kx
k-1
Need to prove it is true for n=k+1
B
k+1(x + 1) - B
k+1(x) = (k+1)x
k
B
k+1(x + 1) - B
k+1(x)
= (k+1)∫B
k(x+1)dx - (k+1)∫B
k(x)dx
= (k+1)∫{B
k(x+1)dx - B
k(x)}dx
= (k+1)∫kx
k-1dx by assumption
= (k+1)x
k + c
i.e. B
k+1(x + 1) - B
k+1(x) = (k+1)x
k + c
sub x = 0: B
k+1(1) - B
k+1(0) = c
=> c = 0 from (ii) where n = k+1
.:B
k+1(x + 1) - B
k+1(x) = (k+1)x
k
The statement is true for n = k+1, if true for n = k, but since it is true for n = 1, it is true for all n ≥ 1.
(iv)
Using the fact that
B
n(m + 1) - B
n(m) = nm
n-1
Sum the m's (i.e. x's) from 0 to some integer k.
n∑
km=0m
n-1 = ∑
m=0k{B
n(m + 1) - B
n(m)}
The RHS is a collapsing sum:
RHS = [B
n(1) - B
n(0)] + [B
n(2) - B
n(1)] - [B
n(3) - B
n(2)] + ...... + [B
n(k) - B
n(k - 1)] + [B
n(k + 1) - B
n(k)]
= B
n(k + 1) - B
n(0)
Hence:
n∑
km=0m
n-1 = B
n(k + 1) - B
n(0)
(v)
Let k = 135 and n = 5
5∑
135m=0m
4 = B
5(136) - B
5(0)
We need the Bernoulli polynomial B
5(x):
B'
5(x) = 5B
4(x)
=> B
5(x) = ∫[5x
4 - 10x³ + 5x² - 1/6]dx
B
5(x) = x
5 - (5/2)x
4 + (5/3)x³ - x/6 + c
But ∫
01B
5(x)dx = 0
=> ∫
01[x
5 - (5/2)x
4 + (5/3)x³ - x/6 + c]dx = 0
=> 1/6 - 1/2 + 5/12 - 1/12 + c = 0
=> c = 0
Hence B
5(x) = x
5 - (5/2)x
4 + (5/3)x³ - x/6
5∑
135m=0m
4 = B
5(136) - B
5(0)]
=>∑
135m=0m
4 = (1/5)[B
5(136) - B
5(0)
But:
B
5(0) = 0
and
(1/5)B
5(136) = 9 134 962 308
Hence we have the result.
Have fun deciphering that! LOL