Chapter 2

1, Prove the following formulas by induction.

n(n + 1)(2n + 1)
(i) 1 + L + n =
2 2

6
Proof:
1 ⋅ (1 + 1)(2 ⋅ 1 + 1) 6
For n=1, we know 1 = 1 also = = 1 then, checked.
2

6 6
k (k + 1)(2k + 1)
If for n = k, we know 1 + L + k =
2 2
, then
6

k (k + 1)(2k + 1) (k + 1)(k (2k + 1) + 6(k + 1))

12 + L + k 2 + (k + 1) 2 = + (k + 1) 2 =
6 6
(k + 1)(2k + 7k + 6) (k + 1)(k + 2)(2k + 3) (k + 1)((k + 1) + 1)(2(k + 1) + 1)
2
= = =
6 6 6
Q.E.D.

(ii) 1 + L + n = (1 + L + n)
3 3 2

n(n + 1)
First of all, we prove that 1 + L + n =
2
1 ⋅ (1 + 1)
Proof: For n = 1, we know 1 = = 1,
2
k (k + 1)
if n=k, we know 1 + L + k = , then,
2
k (k + 1) k (k + 1) + 2(k + 1)
1 + L + k + (k + 1) = + (k + 1) =
2 2
(k + 1)(k + 2) (k + 1)((k + 1) + 1)
= =
2 2
n(n + 1)
thus, we already proved 1 + L + n =
2
now let’s go back to the 1 + L + n = (1 + L + n)
3 3 2

For n = 1, we know 1 = 1 also 1 = 1 , then, the equation is correct.

3 2

If for n = k, we know 1 + L + k = (1 + L + k ) , then

3 3 2

13 + L + k 3 + (k + 1) 3 = (1 + L + k ) 2 + (k + 1) 3
= (1 + L + k ) 2 + (k + 1)(k + 1) 2
= (1 + L + k ) 2 + k (k + 1) 2 + (k + 1) 2
(k + 1)k
= (1 + L + k ) 2 + 2 ⋅ (k + 1) + (k + 1) 2
2
= (1 + L + k ) + 2 ⋅ (1 + L + k )(k + 1) + (k + 1) 2 = (1 + L + k + (k + 1)) 2
2

Q.E.D.
5. Prove by induction on n that

1 − r n +1
1+ r + r +L+ r =
2 n
if r ≠ 0
1− r
Proof:

1 − r 2 (1 − r )(1 + r )
For n = 1, = = (1 + r ) r ≠ 0 , equation checked.
1− r (1 − r )

1 − r k +1
Assume for n = k, 1 + r + r + L + r =
2 k
, then
1− r

1 − r k +1 1 − r k +1 + (1 − r )r k +1
1 + r + r 2 + L + r k + r k +1 = + r k +1 =
1− r 1− r
1 − r k +1 + r k +1 − r k + 2 1− r ( k +1) +1
= = r ≠1
1− r 1− r
Q.E.D.
(b) Derive this result by setting S = 1 + r + r + L + r , multiplying this equation by r, and
2 n

solving the two equation for S.

Solve:

let S = 1 + r + r 2 + L + r n , then S ⋅ r = (1 + r + L + r n )r = r + r 2 + L + r n + r n +1
= S − 1 + r n +1
r n +1 − 1 1 − r n +1
∴ S ⋅ r = S + r n +1 − 1 ⇔ S ⋅ (r − 1) = r n +1 − 1 ⇔ S = = r ≠1
r −1 1− r
Chapter 3

6. (a) If x1 , x 2 , L , x n are distinct numbers, find a polynomial function f i of degree n-1 which is

1 at xi and 0 at x j for j ≠ i .

Solve:
n
Let ∂ ( x) = ∏ ( x − x j ) , we have ∂ ( x k ) = 0, for ∀k ≠ i
j =1
j ≠i

∂ ( x)
∴ let σ ( x) = then σ ( xi ) = 1 and σ ( x k ) = 0 for k ≠ i
∂ ( xi )
Q.E.D.

(b) Now find a polynomial function f of degree n-1 such that f ( xi ) = ai where a1 ,L, a n

are given numbers.

Solve:
 n

∏ (x − x )
i =1
i
n
let δ ( x) = ∑ a j
i≠ j
n
, then δ ( xi ) = a i
j =1
∏ (x
i =1
j − xi )
i≠ j

13. (a) Prove that function f with domain ℜ can be written f = E + O where E is even

and O is odd.
Solve:
f ( x) + f (− x) f ( x) − f (− x)
Let E ( x) = O ( x) = then
2 2
f ( x) = E ( x) + O ( x)
f ( − x) + f ( x) f ( x) + f ( − x)
E ( − x) = = = E ( x) E is even.
2 2
f ( − x) − f ( x) f ( x) − f (− x)
O ( − x) = =− = −O( x) O is odd
2 2
Q.E.D.

(b) Prove that this way of writing f is unique.

Proof:
assume there are more than one way to do so, then there must be
f = E + O and f = E '+O' in which E and E ' are even, O and O' are odd
then E (− x) = E ( x), E ' (− x) = E ' ( x), O(− x) = −O( x), O' (− x) = −O' ( x)
∴ f ( x) + f (− x) = E ( x) + O ( x) + E (− x) + O (− x)
= E ( x) + O ( x) + E ( x) − O ( x) = 2 E ( x)
also f ( x) + f (− x) = E ' ( x) + O' ( x) + E ' (− x) + O' (− x) = 2 E ' ( x)
thus E ' ( x) = E ( x)
similarly , we can prove that O' ( x) = O( x).
Q.E.D.